./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-64.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-64.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 a9f11f8c88de8998bc882c7dd2efba11633c83e29912cc5a80cdbf720cc0a7ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:26:43,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:26:43,358 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:26:43,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:26:43,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:26:43,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:26:43,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:26:43,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:26:43,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:26:43,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:26:43,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:26:43,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:26:43,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:26:43,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:26:43,392 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:26:43,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:26:43,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:26:43,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:26:43,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:26:43,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:26:43,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:26:43,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:26:43,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:26:43,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:26:43,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:26:43,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:26:43,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:26:43,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:26:43,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:26:43,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:43,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:43,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:43,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:43,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:26:43,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:26:43,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:26:43,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:26:43,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:43,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:26:43,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:26:43,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:26:43,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:26:43,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:26:43,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:26:43,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:26:43,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:26:43,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:26:43,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:26:43,396 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 -> a9f11f8c88de8998bc882c7dd2efba11633c83e29912cc5a80cdbf720cc0a7ec [2025-01-09 14:26:43,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:26:43,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:26:43,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:26:43,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:26:43,702 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:26:43,704 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-64.i [2025-01-09 14:26:44,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79241d306/6261d42153214a819d39d38c73de692e/FLAGae41985fc [2025-01-09 14:26:45,256 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:26:45,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-64.i [2025-01-09 14:26:45,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79241d306/6261d42153214a819d39d38c73de692e/FLAGae41985fc [2025-01-09 14:26:45,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79241d306/6261d42153214a819d39d38c73de692e [2025-01-09 14:26:45,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:26:45,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:26:45,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:45,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:26:45,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:26:45,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad399b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45, skipping insertion in model container [2025-01-09 14:26:45,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:26:45,468 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-64.i[916,929] [2025-01-09 14:26:45,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:45,610 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:26:45,618 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-64.i[916,929] [2025-01-09 14:26:45,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:26:45,714 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:26:45,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45 WrapperNode [2025-01-09 14:26:45,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:26:45,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:45,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:26:45,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:26:45,725 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:26:45" (1/1) ... [2025-01-09 14:26:45,747 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:26:45" (1/1) ... [2025-01-09 14:26:45,806 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 369 [2025-01-09 14:26:45,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:26:45,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:26:45,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:26:45,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:26:45,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,873 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:26:45,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:26:45,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:26:45,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:26:45,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:26:45,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (1/1) ... [2025-01-09 14:26:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:26:45,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:45,992 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:26:45,995 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:26:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:26:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:26:46,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:26:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:26:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:26:46,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:26:46,151 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:26:46,153 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:26:46,976 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-01-09 14:26:46,976 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:26:46,990 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:26:46,990 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:26:46,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:46 BoogieIcfgContainer [2025-01-09 14:26:46,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:26:46,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:26:46,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:26:46,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:26:46,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:26:45" (1/3) ... [2025-01-09 14:26:46,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a31646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:46, skipping insertion in model container [2025-01-09 14:26:46,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:26:45" (2/3) ... [2025-01-09 14:26:46,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a31646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:26:46, skipping insertion in model container [2025-01-09 14:26:46,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:26:46" (3/3) ... [2025-01-09 14:26:47,000 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-64.i [2025-01-09 14:26:47,014 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:26:47,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-64.i that has 2 procedures, 152 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:26:47,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:26:47,089 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;@bbd47df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:26:47,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:26:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 111 states have internal predecessors, (168), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 14:26:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-09 14:26:47,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:47,109 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:47,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:47,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash 629006946, now seen corresponding path program 1 times [2025-01-09 14:26:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:47,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179062964] [2025-01-09 14:26:47,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:47,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 14:26:47,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 14:26:47,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:47,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-01-09 14:26:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179062964] [2025-01-09 14:26:47,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179062964] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:47,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959469893] [2025-01-09 14:26:47,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:47,638 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:26:47,640 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:26:47,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 14:26:47,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 14:26:47,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:47,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:47,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:26:47,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-01-09 14:26:47,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:26:47,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959469893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:47,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:26:47,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:26:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789559872] [2025-01-09 14:26:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:47,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:26:47,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:48,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:26:48,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:26:48,011 INFO L87 Difference]: Start difference. First operand has 152 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 111 states have internal predecessors, (168), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 14:26:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:48,061 INFO L93 Difference]: Finished difference Result 298 states and 526 transitions. [2025-01-09 14:26:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:26:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 260 [2025-01-09 14:26:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:48,072 INFO L225 Difference]: With dead ends: 298 [2025-01-09 14:26:48,073 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 14:26:48,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 261 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:26:48,081 INFO L435 NwaCegarLoop]: 241 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, 241 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:26:48,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 14:26:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-01-09 14:26:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 108 states have (on average 1.5092592592592593) internal successors, (163), 108 states have internal predecessors, (163), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 14:26:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 241 transitions. [2025-01-09 14:26:48,140 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 241 transitions. Word has length 260 [2025-01-09 14:26:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:48,140 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 241 transitions. [2025-01-09 14:26:48,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 14:26:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 241 transitions. [2025-01-09 14:26:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-09 14:26:48,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:48,148 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:48,158 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:26:48,349 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:26:48,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:48,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash -311985560, now seen corresponding path program 1 times [2025-01-09 14:26:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:48,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64975854] [2025-01-09 14:26:48,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:48,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:48,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 14:26:48,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 14:26:48,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:48,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:26:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64975854] [2025-01-09 14:26:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64975854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:48,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:48,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:26:48,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816351469] [2025-01-09 14:26:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:48,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:26:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:48,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:26:48,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:26:48,794 INFO L87 Difference]: Start difference. First operand 149 states and 241 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:48,881 INFO L93 Difference]: Finished difference Result 373 states and 609 transitions. [2025-01-09 14:26:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:26:48,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 260 [2025-01-09 14:26:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:48,886 INFO L225 Difference]: With dead ends: 373 [2025-01-09 14:26:48,886 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 14:26:48,887 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:26:48,888 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 121 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:48,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 474 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 14:26:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 169. [2025-01-09 14:26:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 128 states have (on average 1.5390625) internal successors, (197), 128 states have internal predecessors, (197), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 14:26:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 275 transitions. [2025-01-09 14:26:48,911 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 275 transitions. Word has length 260 [2025-01-09 14:26:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:48,914 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 275 transitions. [2025-01-09 14:26:48,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 275 transitions. [2025-01-09 14:26:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-09 14:26:48,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:48,918 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:48,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:26:48,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:48,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 347545962, now seen corresponding path program 1 times [2025-01-09 14:26:48,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:48,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558242911] [2025-01-09 14:26:48,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:48,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:48,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 14:26:48,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 14:26:48,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:48,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:26:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:49,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558242911] [2025-01-09 14:26:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558242911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:49,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:26:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294421895] [2025-01-09 14:26:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:49,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:26:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:49,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:26:49,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:26:49,193 INFO L87 Difference]: Start difference. First operand 169 states and 275 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:49,250 INFO L93 Difference]: Finished difference Result 393 states and 642 transitions. [2025-01-09 14:26:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:26:49,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 260 [2025-01-09 14:26:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:49,255 INFO L225 Difference]: With dead ends: 393 [2025-01-09 14:26:49,256 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 14:26:49,257 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:26:49,258 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 118 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:49,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 587 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 14:26:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 175. [2025-01-09 14:26:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.544776119402985) internal successors, (207), 134 states have internal predecessors, (207), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 14:26:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 285 transitions. [2025-01-09 14:26:49,287 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 285 transitions. Word has length 260 [2025-01-09 14:26:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:49,288 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 285 transitions. [2025-01-09 14:26:49,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 285 transitions. [2025-01-09 14:26:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-01-09 14:26:49,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:49,294 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:49,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:26:49,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1738217921, now seen corresponding path program 1 times [2025-01-09 14:26:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:49,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271310994] [2025-01-09 14:26:49,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:49,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 14:26:49,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 14:26:49,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:49,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:26:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271310994] [2025-01-09 14:26:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271310994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:49,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:49,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:49,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818733565] [2025-01-09 14:26:49,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:49,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:49,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:49,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:49,973 INFO L87 Difference]: Start difference. First operand 175 states and 285 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:50,320 INFO L93 Difference]: Finished difference Result 568 states and 927 transitions. [2025-01-09 14:26:50,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:50,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 262 [2025-01-09 14:26:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:50,324 INFO L225 Difference]: With dead ends: 568 [2025-01-09 14:26:50,325 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 14:26:50,326 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:26:50,328 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 363 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:50,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 659 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:26:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 14:26:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 382. [2025-01-09 14:26:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 301 states have (on average 1.5614617940199336) internal successors, (470), 301 states have internal predecessors, (470), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 14:26:50,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 626 transitions. [2025-01-09 14:26:50,387 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 626 transitions. Word has length 262 [2025-01-09 14:26:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:50,387 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 626 transitions. [2025-01-09 14:26:50,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 626 transitions. [2025-01-09 14:26:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-09 14:26:50,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:50,391 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:50,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:26:50,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:50,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash 833140464, now seen corresponding path program 1 times [2025-01-09 14:26:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:50,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301872364] [2025-01-09 14:26:50,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:50,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:50,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 14:26:50,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 14:26:50,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:50,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:26:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:51,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301872364] [2025-01-09 14:26:51,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301872364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:51,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:51,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805383722] [2025-01-09 14:26:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:51,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:51,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:51,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:51,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:51,133 INFO L87 Difference]: Start difference. First operand 382 states and 626 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:51,240 INFO L93 Difference]: Finished difference Result 886 states and 1444 transitions. [2025-01-09 14:26:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:51,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 263 [2025-01-09 14:26:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:51,247 INFO L225 Difference]: With dead ends: 886 [2025-01-09 14:26:51,249 INFO L226 Difference]: Without dead ends: 507 [2025-01-09 14:26:51,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:26:51,252 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 137 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:51,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 684 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:26:51,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-09 14:26:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2025-01-09 14:26:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 400 states have (on average 1.5375) internal successors, (615), 401 states have internal predecessors, (615), 99 states have call successors, (99), 4 states have call predecessors, (99), 4 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 14:26:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 813 transitions. [2025-01-09 14:26:51,303 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 813 transitions. Word has length 263 [2025-01-09 14:26:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:51,305 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 813 transitions. [2025-01-09 14:26:51,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 813 transitions. [2025-01-09 14:26:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-09 14:26:51,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:51,312 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:51,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:26:51,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:51,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash -972297870, now seen corresponding path program 1 times [2025-01-09 14:26:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:51,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060808650] [2025-01-09 14:26:51,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:51,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:51,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 14:26:51,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 14:26:51,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:51,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-01-09 14:26:52,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:52,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060808650] [2025-01-09 14:26:52,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060808650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:52,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91773436] [2025-01-09 14:26:52,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:52,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:52,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:52,279 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:26:52,282 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:26:52,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 14:26:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 14:26:52,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:52,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:52,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:26:52,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2025-01-09 14:26:52,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:26:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-01-09 14:26:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91773436] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:26:53,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:26:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:26:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631376759] [2025-01-09 14:26:53,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:26:53,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:26:53,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:53,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:26:53,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:26:53,123 INFO L87 Difference]: Start difference. First operand 504 states and 813 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-01-09 14:26:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:53,562 INFO L93 Difference]: Finished difference Result 849 states and 1364 transitions. [2025-01-09 14:26:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:26:53,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 263 [2025-01-09 14:26:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:53,566 INFO L225 Difference]: With dead ends: 849 [2025-01-09 14:26:53,566 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 14:26:53,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 523 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:26:53,568 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 269 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:53,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 552 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:26:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 14:26:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2025-01-09 14:26:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 246 states have (on average 1.4878048780487805) internal successors, (366), 246 states have internal predecessors, (366), 78 states have call successors, (78), 5 states have call predecessors, (78), 5 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 14:26:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 522 transitions. [2025-01-09 14:26:53,605 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 522 transitions. Word has length 263 [2025-01-09 14:26:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:53,606 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 522 transitions. [2025-01-09 14:26:53,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-01-09 14:26:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 522 transitions. [2025-01-09 14:26:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-09 14:26:53,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:53,610 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:53,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:26:53,811 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:26:53,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:53,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:53,812 INFO L85 PathProgramCache]: Analyzing trace with hash -206777915, now seen corresponding path program 1 times [2025-01-09 14:26:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:53,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229085566] [2025-01-09 14:26:53,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:53,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 14:26:53,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 14:26:53,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:53,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:26:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229085566] [2025-01-09 14:26:54,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229085566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:26:54,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:26:54,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:26:54,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15902934] [2025-01-09 14:26:54,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:26:54,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:26:54,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:26:54,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:26:54,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:26:54,302 INFO L87 Difference]: Start difference. First operand 330 states and 522 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:26:54,503 INFO L93 Difference]: Finished difference Result 552 states and 873 transitions. [2025-01-09 14:26:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:26:54,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 263 [2025-01-09 14:26:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:26:54,506 INFO L225 Difference]: With dead ends: 552 [2025-01-09 14:26:54,506 INFO L226 Difference]: Without dead ends: 322 [2025-01-09 14:26:54,507 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:26:54,508 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 190 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:26:54,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 661 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:26:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-09 14:26:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 310. [2025-01-09 14:26:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 226 states have (on average 1.4646017699115044) internal successors, (331), 226 states have internal predecessors, (331), 78 states have call successors, (78), 5 states have call predecessors, (78), 5 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 14:26:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 487 transitions. [2025-01-09 14:26:54,545 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 487 transitions. Word has length 263 [2025-01-09 14:26:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:26:54,545 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 487 transitions. [2025-01-09 14:26:54,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:26:54,546 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 487 transitions. [2025-01-09 14:26:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-09 14:26:54,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:26:54,551 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:26:54,552 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:26:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:26:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1270379168, now seen corresponding path program 1 times [2025-01-09 14:26:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:26:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254460238] [2025-01-09 14:26:54,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:26:54,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 14:26:55,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 14:26:55,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:55,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-01-09 14:26:58,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:26:58,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254460238] [2025-01-09 14:26:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254460238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:26:58,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891356884] [2025-01-09 14:26:58,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:26:58,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:26:58,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:26:58,544 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:26:58,547 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:26:58,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 14:26:58,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 14:26:58,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:26:58,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:26:58,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 14:26:58,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:26:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1903 proven. 171 refuted. 0 times theorem prover too weak. 890 trivial. 0 not checked. [2025-01-09 14:26:59,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891356884] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:00,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:27:00,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2025-01-09 14:27:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215800652] [2025-01-09 14:27:00,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:00,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:27:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:00,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:27:00,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:27:00,406 INFO L87 Difference]: Start difference. First operand 310 states and 487 transitions. Second operand has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 6 states have call successors, (78), 4 states have call predecessors, (78), 6 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2025-01-09 14:27:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:03,870 INFO L93 Difference]: Finished difference Result 662 states and 1008 transitions. [2025-01-09 14:27:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 14:27:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 6 states have call successors, (78), 4 states have call predecessors, (78), 6 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) Word has length 265 [2025-01-09 14:27:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:03,875 INFO L225 Difference]: With dead ends: 662 [2025-01-09 14:27:03,875 INFO L226 Difference]: Without dead ends: 449 [2025-01-09 14:27:03,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=519, Invalid=1931, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 14:27:03,877 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 1209 mSDsluCounter, 1977 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:03,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 2230 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 14:27:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-01-09 14:27:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 353. [2025-01-09 14:27:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 261 states have (on average 1.3946360153256705) internal successors, (364), 261 states have internal predecessors, (364), 78 states have call successors, (78), 13 states have call predecessors, (78), 13 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 14:27:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 520 transitions. [2025-01-09 14:27:03,926 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 520 transitions. Word has length 265 [2025-01-09 14:27:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:03,927 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 520 transitions. [2025-01-09 14:27:03,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 6 states have call successors, (78), 4 states have call predecessors, (78), 6 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2025-01-09 14:27:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 520 transitions. [2025-01-09 14:27:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-09 14:27:03,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:03,931 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:03,941 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:27:04,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:04,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:04,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash 345431040, now seen corresponding path program 1 times [2025-01-09 14:27:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:04,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383682008] [2025-01-09 14:27:04,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:04,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:04,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 14:27:04,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 14:27:04,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:04,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-01-09 14:27:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383682008] [2025-01-09 14:27:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383682008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:27:04,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:27:04,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:27:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93915921] [2025-01-09 14:27:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:27:04,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:27:04,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:04,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:27:04,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:27:04,461 INFO L87 Difference]: Start difference. First operand 353 states and 520 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:27:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:04,655 INFO L93 Difference]: Finished difference Result 562 states and 841 transitions. [2025-01-09 14:27:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:27:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 265 [2025-01-09 14:27:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:04,659 INFO L225 Difference]: With dead ends: 562 [2025-01-09 14:27:04,659 INFO L226 Difference]: Without dead ends: 340 [2025-01-09 14:27:04,660 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:27:04,660 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:04,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 217 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:27:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-01-09 14:27:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-01-09 14:27:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 248 states have (on average 1.3629032258064515) internal successors, (338), 248 states have internal predecessors, (338), 78 states have call successors, (78), 13 states have call predecessors, (78), 13 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 14:27:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 494 transitions. [2025-01-09 14:27:04,712 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 494 transitions. Word has length 265 [2025-01-09 14:27:04,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:04,712 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 494 transitions. [2025-01-09 14:27:04,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-01-09 14:27:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2025-01-09 14:27:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-09 14:27:04,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:04,717 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:04,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:27:04,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:04,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:04,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1382271529, now seen corresponding path program 1 times [2025-01-09 14:27:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:04,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051582572] [2025-01-09 14:27:04,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:04,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:04,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 14:27:05,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 14:27:05,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:05,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:27:05,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [402096606] [2025-01-09 14:27:05,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:05,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:05,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:05,474 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:27:05,476 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:27:05,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 14:27:05,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 14:27:05,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:05,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:05,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 14:27:05,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1754 proven. 138 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2025-01-09 14:27:09,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051582572] [2025-01-09 14:27:13,900 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:27:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402096606] [2025-01-09 14:27:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402096606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:13,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:13,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2025-01-09 14:27:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911777045] [2025-01-09 14:27:13,901 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:13,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 14:27:13,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:13,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 14:27:13,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 14:27:13,902 INFO L87 Difference]: Start difference. First operand 340 states and 494 transitions. Second operand has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 27 states have internal predecessors, (101), 7 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) [2025-01-09 14:27:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:17,291 INFO L93 Difference]: Finished difference Result 739 states and 1056 transitions. [2025-01-09 14:27:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 14:27:17,291 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 27 states have internal predecessors, (101), 7 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) Word has length 266 [2025-01-09 14:27:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:17,295 INFO L225 Difference]: With dead ends: 739 [2025-01-09 14:27:17,295 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 14:27:17,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=907, Invalid=3515, Unknown=0, NotChecked=0, Total=4422 [2025-01-09 14:27:17,297 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1018 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:17,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 2170 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:27:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 14:27:17,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 457. [2025-01-09 14:27:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 352 states have (on average 1.3664772727272727) internal successors, (481), 353 states have internal predecessors, (481), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 14:27:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 649 transitions. [2025-01-09 14:27:17,364 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 649 transitions. Word has length 266 [2025-01-09 14:27:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:17,365 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 649 transitions. [2025-01-09 14:27:17,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 27 states have internal predecessors, (101), 7 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (39), 8 states have call predecessors, (39), 7 states have call successors, (39) [2025-01-09 14:27:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 649 transitions. [2025-01-09 14:27:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-09 14:27:17,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:17,370 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:17,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:27:17,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 14:27:17,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:17,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash 540956505, now seen corresponding path program 1 times [2025-01-09 14:27:17,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:17,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912026118] [2025-01-09 14:27:17,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:17,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:17,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 14:27:18,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 14:27:18,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:18,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:27:18,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473235238] [2025-01-09 14:27:18,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:18,070 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:27:18,072 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:27:18,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 14:27:18,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 14:27:18,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:18,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:18,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 14:27:18,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1266 proven. 168 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2025-01-09 14:27:19,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:27:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:27:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912026118] [2025-01-09 14:27:20,003 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:27:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473235238] [2025-01-09 14:27:20,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473235238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:27:20,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:27:20,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-01-09 14:27:20,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814116599] [2025-01-09 14:27:20,003 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 14:27:20,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:27:20,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:27:20,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:27:20,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:27:20,005 INFO L87 Difference]: Start difference. First operand 457 states and 649 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 14:27:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:27:21,342 INFO L93 Difference]: Finished difference Result 706 states and 1006 transitions. [2025-01-09 14:27:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 14:27:21,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 266 [2025-01-09 14:27:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:27:21,346 INFO L225 Difference]: With dead ends: 706 [2025-01-09 14:27:21,346 INFO L226 Difference]: Without dead ends: 484 [2025-01-09 14:27:21,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:27:21,348 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 547 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:27:21,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1389 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:27:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-01-09 14:27:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 445. [2025-01-09 14:27:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 340 states have (on average 1.361764705882353) internal successors, (463), 341 states have internal predecessors, (463), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 14:27:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 631 transitions. [2025-01-09 14:27:21,411 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 631 transitions. Word has length 266 [2025-01-09 14:27:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:27:21,412 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 631 transitions. [2025-01-09 14:27:21,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-01-09 14:27:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 631 transitions. [2025-01-09 14:27:21,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-01-09 14:27:21,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:27:21,415 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:21,426 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:27:21,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 14:27:21,615 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:27:21,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:27:21,616 INFO L85 PathProgramCache]: Analyzing trace with hash 62871521, now seen corresponding path program 1 times [2025-01-09 14:27:21,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:27:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807298261] [2025-01-09 14:27:21,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:21,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:27:21,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 14:27:22,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 14:27:22,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:22,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:27:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [303278595] [2025-01-09 14:27:22,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:27:22,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:27:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:27:22,199 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:27:22,202 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:27:22,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-01-09 14:27:22,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-01-09 14:27:22,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:27:22,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:27:22,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-01-09 14:27:22,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:27:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1519 proven. 153 refuted. 0 times theorem prover too weak. 1292 trivial. 0 not checked. [2025-01-09 14:27:27,616 INFO L312 TraceCheckSpWp]: Computing backward predicates...