./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-23.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 ed0b1861101548b730fb063fdf9036ca893ba003f1a5026e39b1db8e4f4805e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:44:38,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:44:38,475 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:44:38,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:44:38,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:44:38,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:44:38,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:44:38,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:44:38,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:44:38,511 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:44:38,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:44:38,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:44:38,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:44:38,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:44:38,512 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:44:38,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:44:38,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:44:38,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:44:38,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:44:38,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:38,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:38,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:38,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:38,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:44:38,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:38,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:38,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:44:38,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:44:38,516 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 -> ed0b1861101548b730fb063fdf9036ca893ba003f1a5026e39b1db8e4f4805e6 [2025-01-09 14:44:38,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:44:38,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:44:38,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:44:38,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:44:38,781 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:44:38,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-23.i [2025-01-09 14:44:40,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bceada4a/d322c82a8bb9443cb8b44675b8f54dfe/FLAG4835b715c [2025-01-09 14:44:40,420 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:44:40,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-23.i [2025-01-09 14:44:40,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bceada4a/d322c82a8bb9443cb8b44675b8f54dfe/FLAG4835b715c [2025-01-09 14:44:40,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8bceada4a/d322c82a8bb9443cb8b44675b8f54dfe [2025-01-09 14:44:40,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:44:40,480 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:44:40,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:44:40,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:44:40,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:44:40,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:40,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173f01ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40, skipping insertion in model container [2025-01-09 14:44:40,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:40,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:44:40,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-23.i[916,929] [2025-01-09 14:44:40,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:44:40,803 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:44:40,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-23.i[916,929] [2025-01-09 14:44:40,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:44:40,954 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:44:40,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40 WrapperNode [2025-01-09 14:44:40,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:44:40,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:44:40,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:44:40,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:44:40,964 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:44:40" (1/1) ... [2025-01-09 14:44:40,988 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:44:40" (1/1) ... [2025-01-09 14:44:41,044 INFO L138 Inliner]: procedures = 26, calls = 90, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 757 [2025-01-09 14:44:41,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:44:41,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:44:41,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:44:41,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:44:41,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,159 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:44:41,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:44:41,235 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:44:41,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:44:41,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:44:41,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (1/1) ... [2025-01-09 14:44:41,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:41,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:41,261 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:44:41,266 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:44:41,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:44:41,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:44:41,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:44:41,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:44:41,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:44:41,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:44:41,393 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:44:41,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:44:42,358 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-01-09 14:44:42,359 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:44:42,373 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:44:42,375 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:44:42,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:44:42 BoogieIcfgContainer [2025-01-09 14:44:42,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:44:42,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:44:42,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:44:42,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:44:42,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:44:40" (1/3) ... [2025-01-09 14:44:42,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34915119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:44:42, skipping insertion in model container [2025-01-09 14:44:42,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:44:40" (2/3) ... [2025-01-09 14:44:42,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34915119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:44:42, skipping insertion in model container [2025-01-09 14:44:42,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:44:42" (3/3) ... [2025-01-09 14:44:42,384 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-23.i [2025-01-09 14:44:42,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:44:42,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-23.i that has 2 procedures, 303 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:44:42,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:44:42,458 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;@252a2d4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:44:42,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:44:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 223 states have (on average 1.5336322869955157) internal successors, (342), 224 states have internal predecessors, (342), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 14:44:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:44:42,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:42,493 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:42,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:42,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:42,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2142896232, now seen corresponding path program 1 times [2025-01-09 14:44:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896458188] [2025-01-09 14:44:42,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:42,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:42,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:42,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:42,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:42,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 152 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-01-09 14:44:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896458188] [2025-01-09 14:44:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896458188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855659467] [2025-01-09 14:44:43,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:43,113 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:44:43,118 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:44:43,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:43,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:43,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:43,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:43,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:44:43,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2025-01-09 14:44:43,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:44:43,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855659467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:43,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:44:43,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:44:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932491020] [2025-01-09 14:44:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:43,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:44:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:43,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:44:43,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:44:43,578 INFO L87 Difference]: Start difference. First operand has 303 states, 223 states have (on average 1.5336322869955157) internal successors, (342), 224 states have internal predecessors, (342), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:44:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:43,616 INFO L93 Difference]: Finished difference Result 600 states and 1064 transitions. [2025-01-09 14:44:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:44:43,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) Word has length 530 [2025-01-09 14:44:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:43,623 INFO L225 Difference]: With dead ends: 600 [2025-01-09 14:44:43,624 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 14:44:43,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 531 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:44:43,629 INFO L435 NwaCegarLoop]: 489 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, 489 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:44:43,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:44:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 14:44:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-01-09 14:44:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 221 states have (on average 1.5158371040723981) internal successors, (335), 221 states have internal predecessors, (335), 77 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 14:44:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 489 transitions. [2025-01-09 14:44:43,697 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 489 transitions. Word has length 530 [2025-01-09 14:44:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:43,697 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 489 transitions. [2025-01-09 14:44:43,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (77), 2 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:44:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 489 transitions. [2025-01-09 14:44:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:44:43,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:43,705 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:43,717 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:44:43,910 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:44:43,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:43,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1171806730, now seen corresponding path program 1 times [2025-01-09 14:44:43,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124280727] [2025-01-09 14:44:43,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:43,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:44,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:44,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:44,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:44:44,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:44,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124280727] [2025-01-09 14:44:44,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124280727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:44,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:44,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:44,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580702419] [2025-01-09 14:44:44,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:44,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:44,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:44,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:44,427 INFO L87 Difference]: Start difference. First operand 300 states and 489 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:44:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:44,548 INFO L93 Difference]: Finished difference Result 894 states and 1461 transitions. [2025-01-09 14:44:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:44,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 530 [2025-01-09 14:44:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:44,557 INFO L225 Difference]: With dead ends: 894 [2025-01-09 14:44:44,557 INFO L226 Difference]: Without dead ends: 597 [2025-01-09 14:44:44,558 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:44:44,562 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 478 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:44,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1256 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-01-09 14:44:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2025-01-09 14:44:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 438 states have (on average 1.5136986301369864) internal successors, (663), 438 states have internal predecessors, (663), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:44:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 971 transitions. [2025-01-09 14:44:44,651 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 971 transitions. Word has length 530 [2025-01-09 14:44:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:44,654 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 971 transitions. [2025-01-09 14:44:44,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:44:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 971 transitions. [2025-01-09 14:44:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:44:44,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:44,663 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:44:44,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:44,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash -860356150, now seen corresponding path program 1 times [2025-01-09 14:44:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:44,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705711288] [2025-01-09 14:44:44,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:44,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:44,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:44,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:44,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:44:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705711288] [2025-01-09 14:44:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705711288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:45,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955579885] [2025-01-09 14:44:45,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:45,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:45,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:45,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:45,127 INFO L87 Difference]: Start difference. First operand 595 states and 971 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:44:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:45,249 INFO L93 Difference]: Finished difference Result 1767 states and 2886 transitions. [2025-01-09 14:44:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:45,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 530 [2025-01-09 14:44:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:45,262 INFO L225 Difference]: With dead ends: 1767 [2025-01-09 14:44:45,262 INFO L226 Difference]: Without dead ends: 1175 [2025-01-09 14:44:45,264 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:44:45,266 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 465 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:45,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1382 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-01-09 14:44:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 751. [2025-01-09 14:44:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 594 states have (on average 1.5505050505050506) internal successors, (921), 594 states have internal predecessors, (921), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:44:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1229 transitions. [2025-01-09 14:44:45,364 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1229 transitions. Word has length 530 [2025-01-09 14:44:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:45,367 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1229 transitions. [2025-01-09 14:44:45,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:44:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1229 transitions. [2025-01-09 14:44:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:44:45,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:45,377 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:45,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:44:45,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:45,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -819681400, now seen corresponding path program 1 times [2025-01-09 14:44:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237551411] [2025-01-09 14:44:45,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:45,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:45,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:45,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:45,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:44:45,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:45,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237551411] [2025-01-09 14:44:45,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237551411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:45,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:45,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:45,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162681317] [2025-01-09 14:44:45,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:45,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:45,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:45,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:45,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:45,706 INFO L87 Difference]: Start difference. First operand 751 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:44:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:45,810 INFO L93 Difference]: Finished difference Result 2192 states and 3587 transitions. [2025-01-09 14:44:45,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:45,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 530 [2025-01-09 14:44:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:45,818 INFO L225 Difference]: With dead ends: 2192 [2025-01-09 14:44:45,819 INFO L226 Difference]: Without dead ends: 1444 [2025-01-09 14:44:45,821 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:44:45,821 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 481 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:45,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 944 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2025-01-09 14:44:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 876. [2025-01-09 14:44:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 719 states have (on average 1.5660639777468706) internal successors, (1126), 719 states have internal predecessors, (1126), 154 states have call successors, (154), 2 states have call predecessors, (154), 2 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2025-01-09 14:44:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1434 transitions. [2025-01-09 14:44:45,901 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1434 transitions. Word has length 530 [2025-01-09 14:44:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:45,902 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1434 transitions. [2025-01-09 14:44:45,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:44:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1434 transitions. [2025-01-09 14:44:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:44:45,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:45,908 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:45,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:44:45,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 73804938, now seen corresponding path program 1 times [2025-01-09 14:44:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:45,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332829556] [2025-01-09 14:44:45,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:45,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:46,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:46,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:46,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:44:47,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:47,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332829556] [2025-01-09 14:44:47,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332829556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:47,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:47,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:44:47,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421965101] [2025-01-09 14:44:47,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:47,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:44:47,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:47,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:44:47,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:44:47,148 INFO L87 Difference]: Start difference. First operand 876 states and 1434 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:44:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:48,142 INFO L93 Difference]: Finished difference Result 3335 states and 5461 transitions. [2025-01-09 14:44:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:44:48,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 530 [2025-01-09 14:44:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:48,152 INFO L225 Difference]: With dead ends: 3335 [2025-01-09 14:44:48,153 INFO L226 Difference]: Without dead ends: 2462 [2025-01-09 14:44:48,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:44:48,155 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 1246 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:48,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1868 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:44:48,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2025-01-09 14:44:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2136. [2025-01-09 14:44:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 1859 states have (on average 1.5911780527165142) internal successors, (2958), 1861 states have internal predecessors, (2958), 272 states have call successors, (272), 4 states have call predecessors, (272), 4 states have return successors, (272), 270 states have call predecessors, (272), 272 states have call successors, (272) [2025-01-09 14:44:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 3502 transitions. [2025-01-09 14:44:48,306 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 3502 transitions. Word has length 530 [2025-01-09 14:44:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:48,307 INFO L471 AbstractCegarLoop]: Abstraction has 2136 states and 3502 transitions. [2025-01-09 14:44:48,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:44:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 3502 transitions. [2025-01-09 14:44:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:44:48,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:48,315 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:48,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:44:48,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:48,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1027745096, now seen corresponding path program 1 times [2025-01-09 14:44:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:48,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304246933] [2025-01-09 14:44:48,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:48,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:48,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:48,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:48,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:44:48,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304246933] [2025-01-09 14:44:48,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304246933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:48,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:48,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:44:48,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267349513] [2025-01-09 14:44:48,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:48,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:44:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:48,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:44:48,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:48,896 INFO L87 Difference]: Start difference. First operand 2136 states and 3502 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:44:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:49,077 INFO L93 Difference]: Finished difference Result 5087 states and 8334 transitions. [2025-01-09 14:44:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:44:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 530 [2025-01-09 14:44:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:49,093 INFO L225 Difference]: With dead ends: 5087 [2025-01-09 14:44:49,093 INFO L226 Difference]: Without dead ends: 2954 [2025-01-09 14:44:49,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:44:49,098 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 318 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:49,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1095 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:44:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2025-01-09 14:44:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2025-01-09 14:44:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 2537 states have (on average 1.5798186834844303) internal successors, (4008), 2540 states have internal predecessors, (4008), 408 states have call successors, (408), 6 states have call predecessors, (408), 6 states have return successors, (408), 405 states have call predecessors, (408), 408 states have call successors, (408) [2025-01-09 14:44:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 4824 transitions. [2025-01-09 14:44:49,245 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 4824 transitions. Word has length 530 [2025-01-09 14:44:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:49,246 INFO L471 AbstractCegarLoop]: Abstraction has 2952 states and 4824 transitions. [2025-01-09 14:44:49,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:44:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 4824 transitions. [2025-01-09 14:44:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:44:49,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:49,254 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:49,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:44:49,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:49,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1798990726, now seen corresponding path program 1 times [2025-01-09 14:44:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:49,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831366264] [2025-01-09 14:44:49,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:49,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:49,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:49,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:49,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:44:50,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:50,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831366264] [2025-01-09 14:44:50,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831366264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:44:50,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:44:50,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:44:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282962728] [2025-01-09 14:44:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:44:50,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:44:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:50,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:44:50,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:44:50,347 INFO L87 Difference]: Start difference. First operand 2952 states and 4824 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:44:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:44:51,468 INFO L93 Difference]: Finished difference Result 8011 states and 13053 transitions. [2025-01-09 14:44:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:44:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 530 [2025-01-09 14:44:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:44:51,491 INFO L225 Difference]: With dead ends: 8011 [2025-01-09 14:44:51,491 INFO L226 Difference]: Without dead ends: 5062 [2025-01-09 14:44:51,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:44:51,498 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 1256 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 2214 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:44:51,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 2214 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:44:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2025-01-09 14:44:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 4572. [2025-01-09 14:44:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4572 states, 3905 states have (on average 1.5669654289372599) internal successors, (6119), 3914 states have internal predecessors, (6119), 654 states have call successors, (654), 12 states have call predecessors, (654), 12 states have return successors, (654), 645 states have call predecessors, (654), 654 states have call successors, (654) [2025-01-09 14:44:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4572 states to 4572 states and 7427 transitions. [2025-01-09 14:44:51,795 INFO L78 Accepts]: Start accepts. Automaton has 4572 states and 7427 transitions. Word has length 530 [2025-01-09 14:44:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:44:51,796 INFO L471 AbstractCegarLoop]: Abstraction has 4572 states and 7427 transitions. [2025-01-09 14:44:51,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:44:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4572 states and 7427 transitions. [2025-01-09 14:44:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:44:51,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:44:51,803 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:51,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:44:51,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:44:51,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:44:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 901597448, now seen corresponding path program 1 times [2025-01-09 14:44:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:44:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685898516] [2025-01-09 14:44:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:44:51,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:53,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:53,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:53,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 45 proven. 183 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 14:44:56,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:44:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685898516] [2025-01-09 14:44:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685898516] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:44:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735313959] [2025-01-09 14:44:56,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:44:56,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:44:56,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:44:56,012 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:44:56,013 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:44:56,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:44:56,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:44:56,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:44:56,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:44:56,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:44:56,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:44:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 5718 proven. 135 refuted. 0 times theorem prover too weak. 5851 trivial. 0 not checked. [2025-01-09 14:44:56,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:44:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 93 proven. 135 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 14:44:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735313959] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:44:57,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:44:57,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 17 [2025-01-09 14:44:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153756862] [2025-01-09 14:44:57,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:44:57,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:44:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:44:57,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:44:57,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:44:57,262 INFO L87 Difference]: Start difference. First operand 4572 states and 7427 transitions. Second operand has 17 states, 17 states have (on average 16.705882352941178) internal successors, (284), 17 states have internal predecessors, (284), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) [2025-01-09 14:45:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:04,990 INFO L93 Difference]: Finished difference Result 35089 states and 55096 transitions. [2025-01-09 14:45:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-09 14:45:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 16.705882352941178) internal successors, (284), 17 states have internal predecessors, (284), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) Word has length 530 [2025-01-09 14:45:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:05,068 INFO L225 Difference]: With dead ends: 35089 [2025-01-09 14:45:05,068 INFO L226 Difference]: Without dead ends: 30520 [2025-01-09 14:45:05,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1151 GetRequests, 1070 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2001 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1649, Invalid=4993, Unknown=0, NotChecked=0, Total=6642 [2025-01-09 14:45:05,082 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 6598 mSDsluCounter, 4873 mSDsCounter, 0 mSdLazyCounter, 4004 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6628 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 4790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 4004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:05,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6628 Valid, 5390 Invalid, 4790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 4004 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 14:45:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30520 states. [2025-01-09 14:45:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30520 to 20394. [2025-01-09 14:45:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20394 states, 18665 states have (on average 1.569675863916421) internal successors, (29298), 18719 states have internal predecessors, (29298), 1608 states have call successors, (1608), 120 states have call predecessors, (1608), 120 states have return successors, (1608), 1554 states have call predecessors, (1608), 1608 states have call successors, (1608) [2025-01-09 14:45:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20394 states to 20394 states and 32514 transitions. [2025-01-09 14:45:06,003 INFO L78 Accepts]: Start accepts. Automaton has 20394 states and 32514 transitions. Word has length 530 [2025-01-09 14:45:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 20394 states and 32514 transitions. [2025-01-09 14:45:06,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 16.705882352941178) internal successors, (284), 17 states have internal predecessors, (284), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (200), 4 states have call predecessors, (200), 4 states have call successors, (200) [2025-01-09 14:45:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 20394 states and 32514 transitions. [2025-01-09 14:45:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-01-09 14:45:06,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:06,029 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:06,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:45:06,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:06,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:06,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1000195710, now seen corresponding path program 1 times [2025-01-09 14:45:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:06,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446147394] [2025-01-09 14:45:06,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:06,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-01-09 14:45:06,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-01-09 14:45:06,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:06,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:45:07,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:07,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446147394] [2025-01-09 14:45:07,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446147394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:07,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:07,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:45:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365833743] [2025-01-09 14:45:07,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:07,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:45:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:07,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:45:07,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:45:07,244 INFO L87 Difference]: Start difference. First operand 20394 states and 32514 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:45:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:08,288 INFO L93 Difference]: Finished difference Result 55888 states and 89149 transitions. [2025-01-09 14:45:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:45:08,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 530 [2025-01-09 14:45:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:08,371 INFO L225 Difference]: With dead ends: 55888 [2025-01-09 14:45:08,371 INFO L226 Difference]: Without dead ends: 35428 [2025-01-09 14:45:08,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:45:08,401 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 485 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:08,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2368 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35428 states. [2025-01-09 14:45:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35428 to 20555. [2025-01-09 14:45:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20555 states, 18746 states have (on average 1.5681745439026993) internal successors, (29397), 18800 states have internal predecessors, (29397), 1685 states have call successors, (1685), 123 states have call predecessors, (1685), 123 states have return successors, (1685), 1631 states have call predecessors, (1685), 1685 states have call successors, (1685) [2025-01-09 14:45:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20555 states to 20555 states and 32767 transitions. [2025-01-09 14:45:09,499 INFO L78 Accepts]: Start accepts. Automaton has 20555 states and 32767 transitions. Word has length 530 [2025-01-09 14:45:09,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:09,500 INFO L471 AbstractCegarLoop]: Abstraction has 20555 states and 32767 transitions. [2025-01-09 14:45:09,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:45:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 20555 states and 32767 transitions. [2025-01-09 14:45:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 14:45:09,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:09,525 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:09,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:45:09,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:09,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1233549931, now seen corresponding path program 1 times [2025-01-09 14:45:09,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:09,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515222663] [2025-01-09 14:45:09,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:09,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:09,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:45:09,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:45:09,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:45:09,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:09,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515222663] [2025-01-09 14:45:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515222663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:09,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:09,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:09,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809421684] [2025-01-09 14:45:09,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:09,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:09,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:09,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:09,681 INFO L87 Difference]: Start difference. First operand 20555 states and 32767 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:45:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:10,683 INFO L93 Difference]: Finished difference Result 43963 states and 69896 transitions. [2025-01-09 14:45:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:10,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 531 [2025-01-09 14:45:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:10,741 INFO L225 Difference]: With dead ends: 43963 [2025-01-09 14:45:10,742 INFO L226 Difference]: Without dead ends: 23572 [2025-01-09 14:45:10,767 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:45:10,767 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 320 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:10,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1236 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23572 states. [2025-01-09 14:45:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23572 to 23555. [2025-01-09 14:45:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23555 states, 21272 states have (on average 1.5554249717939075) internal successors, (33087), 21347 states have internal predecessors, (33087), 2135 states have call successors, (2135), 147 states have call predecessors, (2135), 147 states have return successors, (2135), 2060 states have call predecessors, (2135), 2135 states have call successors, (2135) [2025-01-09 14:45:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23555 states to 23555 states and 37357 transitions. [2025-01-09 14:45:11,764 INFO L78 Accepts]: Start accepts. Automaton has 23555 states and 37357 transitions. Word has length 531 [2025-01-09 14:45:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:11,764 INFO L471 AbstractCegarLoop]: Abstraction has 23555 states and 37357 transitions. [2025-01-09 14:45:11,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:45:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23555 states and 37357 transitions. [2025-01-09 14:45:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 14:45:11,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:11,787 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:11,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:45:11,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash 238856233, now seen corresponding path program 1 times [2025-01-09 14:45:11,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:11,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812037507] [2025-01-09 14:45:11,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:11,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:11,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:45:12,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:45:12,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:45:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812037507] [2025-01-09 14:45:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812037507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200539379] [2025-01-09 14:45:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:12,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:12,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:12,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:12,649 INFO L87 Difference]: Start difference. First operand 23555 states and 37357 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:45:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:14,180 INFO L93 Difference]: Finished difference Result 62034 states and 98444 transitions. [2025-01-09 14:45:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) Word has length 531 [2025-01-09 14:45:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:14,369 INFO L225 Difference]: With dead ends: 62034 [2025-01-09 14:45:14,369 INFO L226 Difference]: Without dead ends: 38643 [2025-01-09 14:45:14,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:14,437 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 636 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:14,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1410 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38643 states. [2025-01-09 14:45:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38643 to 38416. [2025-01-09 14:45:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38416 states, 34198 states have (on average 1.548687057722674) internal successors, (52962), 34321 states have internal predecessors, (52962), 3953 states have call successors, (3953), 264 states have call predecessors, (3953), 264 states have return successors, (3953), 3830 states have call predecessors, (3953), 3953 states have call successors, (3953) [2025-01-09 14:45:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38416 states to 38416 states and 60868 transitions. [2025-01-09 14:45:15,800 INFO L78 Accepts]: Start accepts. Automaton has 38416 states and 60868 transitions. Word has length 531 [2025-01-09 14:45:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:15,801 INFO L471 AbstractCegarLoop]: Abstraction has 38416 states and 60868 transitions. [2025-01-09 14:45:15,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 1 states have call predecessors, (77), 1 states have call successors, (77) [2025-01-09 14:45:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 38416 states and 60868 transitions. [2025-01-09 14:45:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-01-09 14:45:15,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:15,832 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:15,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:45:15,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:15,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1349491669, now seen corresponding path program 1 times [2025-01-09 14:45:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354884214] [2025-01-09 14:45:15,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:15,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:15,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:45:17,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:45:17,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:17,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 114 proven. 114 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 14:45:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354884214] [2025-01-09 14:45:17,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354884214] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693339531] [2025-01-09 14:45:17,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:17,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:17,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:17,593 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:45:17,595 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:45:17,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-01-09 14:45:17,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-01-09 14:45:17,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:17,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:17,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:45:17,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 5838 proven. 99 refuted. 0 times theorem prover too weak. 5767 trivial. 0 not checked. [2025-01-09 14:45:18,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:45:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 129 proven. 99 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 14:45:18,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693339531] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:45:18,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:45:18,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 14:45:18,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650771332] [2025-01-09 14:45:18,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:45:18,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:45:18,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:18,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:45:18,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:45:18,687 INFO L87 Difference]: Start difference. First operand 38416 states and 60868 transitions. Second operand has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 4 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-01-09 14:45:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:20,621 INFO L93 Difference]: Finished difference Result 74245 states and 117194 transitions. [2025-01-09 14:45:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:45:20,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 4 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) Word has length 531 [2025-01-09 14:45:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:20,719 INFO L225 Difference]: With dead ends: 74245 [2025-01-09 14:45:20,719 INFO L226 Difference]: Without dead ends: 35988 [2025-01-09 14:45:20,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 1059 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:45:20,768 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 817 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:20,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1014 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:45:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35988 states. [2025-01-09 14:45:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35988 to 35520. [2025-01-09 14:45:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35520 states, 31444 states have (on average 1.5355552728660475) internal successors, (48284), 31555 states have internal predecessors, (48284), 3773 states have call successors, (3773), 302 states have call predecessors, (3773), 302 states have return successors, (3773), 3662 states have call predecessors, (3773), 3773 states have call successors, (3773) [2025-01-09 14:45:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35520 states to 35520 states and 55830 transitions. [2025-01-09 14:45:22,060 INFO L78 Accepts]: Start accepts. Automaton has 35520 states and 55830 transitions. Word has length 531 [2025-01-09 14:45:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:22,060 INFO L471 AbstractCegarLoop]: Abstraction has 35520 states and 55830 transitions. [2025-01-09 14:45:22,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 4 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-01-09 14:45:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 35520 states and 55830 transitions. [2025-01-09 14:45:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:45:22,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:22,085 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:22,095 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:45:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:22,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1040784749, now seen corresponding path program 1 times [2025-01-09 14:45:22,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334538007] [2025-01-09 14:45:22,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:22,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:45:22,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:45:22,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:22,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11704 trivial. 0 not checked. [2025-01-09 14:45:23,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:23,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334538007] [2025-01-09 14:45:23,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334538007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:23,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:23,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 14:45:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315606557] [2025-01-09 14:45:23,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:23,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:45:23,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:23,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:45:23,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:45:23,391 INFO L87 Difference]: Start difference. First operand 35520 states and 55830 transitions. Second operand has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:45:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:29,555 INFO L93 Difference]: Finished difference Result 189948 states and 296390 transitions. [2025-01-09 14:45:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:45:29,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 532 [2025-01-09 14:45:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:29,971 INFO L225 Difference]: With dead ends: 189948 [2025-01-09 14:45:29,971 INFO L226 Difference]: Without dead ends: 154610 [2025-01-09 14:45:30,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:45:30,040 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 3789 mSDsluCounter, 2146 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3789 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:30,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3789 Valid, 3009 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:45:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154610 states. [2025-01-09 14:45:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154610 to 140591. [2025-01-09 14:45:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140591 states, 123990 states have (on average 1.5187676425518186) internal successors, (188312), 124524 states have internal predecessors, (188312), 15269 states have call successors, (15269), 1331 states have call predecessors, (15269), 1331 states have return successors, (15269), 14735 states have call predecessors, (15269), 15269 states have call successors, (15269) [2025-01-09 14:45:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140591 states to 140591 states and 218850 transitions. [2025-01-09 14:45:36,687 INFO L78 Accepts]: Start accepts. Automaton has 140591 states and 218850 transitions. Word has length 532 [2025-01-09 14:45:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:36,688 INFO L471 AbstractCegarLoop]: Abstraction has 140591 states and 218850 transitions. [2025-01-09 14:45:36,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.666666666666668) internal successors, (150), 9 states have internal predecessors, (150), 2 states have call successors, (77), 1 states have call predecessors, (77), 1 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2025-01-09 14:45:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 140591 states and 218850 transitions. [2025-01-09 14:45:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-09 14:45:36,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:36,730 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:36,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:45:36,730 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:36,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash -547563153, now seen corresponding path program 1 times [2025-01-09 14:45:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:36,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987000377] [2025-01-09 14:45:36,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:45:37,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:45:37,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:37,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 123 proven. 105 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 14:45:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:38,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987000377] [2025-01-09 14:45:38,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987000377] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:38,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806114386] [2025-01-09 14:45:38,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:38,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:38,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:38,089 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:45:38,094 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:45:38,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-09 14:45:38,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-09 14:45:38,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:38,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:38,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:45:38,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 5898 proven. 105 refuted. 0 times theorem prover too weak. 5701 trivial. 0 not checked. [2025-01-09 14:45:38,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:45:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 123 proven. 105 refuted. 0 times theorem prover too weak. 11476 trivial. 0 not checked. [2025-01-09 14:45:39,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806114386] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:45:39,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:45:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:45:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737715095] [2025-01-09 14:45:39,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:45:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:45:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:39,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:45:39,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:45:39,205 INFO L87 Difference]: Start difference. First operand 140591 states and 218850 transitions. Second operand has 8 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 3 states have call successors, (147), 2 states have call predecessors, (147), 4 states have return successors, (148), 3 states have call predecessors, (148), 3 states have call successors, (148) [2025-01-09 14:45:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:42,633 INFO L93 Difference]: Finished difference Result 223712 states and 348309 transitions. [2025-01-09 14:45:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:45:42,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.25) internal successors, (226), 8 states have internal predecessors, (226), 3 states have call successors, (147), 2 states have call predecessors, (147), 4 states have return successors, (148), 3 states have call predecessors, (148), 3 states have call successors, (148) Word has length 532 [2025-01-09 14:45:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:43,090 INFO L225 Difference]: With dead ends: 223712 [2025-01-09 14:45:43,090 INFO L226 Difference]: Without dead ends: 83313 [2025-01-09 14:45:43,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 1061 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:45:43,401 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 810 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:43,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 977 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:45:43,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83313 states.