./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.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 c1488e8cfb75b9dc5828151c610bf861156ee926465c8d7b38aa1fb193fa6e77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:22:37,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:22:37,881 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:22:37,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:22:37,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:22:37,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:22:37,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:22:37,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:22:37,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:22:37,910 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:22:37,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:22:37,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:22:37,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:22:37,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:22:37,911 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:22:37,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:22:37,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:22:37,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:22:37,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:22:37,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:22:37,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:22:37,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:22:37,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:22:37,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:22:37,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:22:37,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:22:37,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:22:37,915 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 -> c1488e8cfb75b9dc5828151c610bf861156ee926465c8d7b38aa1fb193fa6e77 [2025-01-09 14:22:38,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:22:38,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:22:38,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:22:38,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:22:38,217 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:22:38,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i [2025-01-09 14:22:39,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c3d5e00/3f3617cb2b4744ee8711dd7515d9974b/FLAG2ba13253a [2025-01-09 14:22:39,815 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:22:39,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i [2025-01-09 14:22:39,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c3d5e00/3f3617cb2b4744ee8711dd7515d9974b/FLAG2ba13253a [2025-01-09 14:22:39,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c3d5e00/3f3617cb2b4744ee8711dd7515d9974b [2025-01-09 14:22:39,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:22:39,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:22:39,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:22:39,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:22:39,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:22:39,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:22:39" (1/1) ... [2025-01-09 14:22:39,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:39, skipping insertion in model container [2025-01-09 14:22:39,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:22:39" (1/1) ... [2025-01-09 14:22:39,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:22:40,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i[915,928] [2025-01-09 14:22:40,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:22:40,141 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:22:40,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-3.i[915,928] [2025-01-09 14:22:40,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:22:40,253 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:22:40,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40 WrapperNode [2025-01-09 14:22:40,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:22:40,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:22:40,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:22:40,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:22:40,260 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:22:40" (1/1) ... [2025-01-09 14:22:40,272 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:22:40" (1/1) ... [2025-01-09 14:22:40,322 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2025-01-09 14:22:40,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:22:40,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:22:40,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:22:40,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:22:40,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,381 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:22:40,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:22:40,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:22:40,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:22:40,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:22:40,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (1/1) ... [2025-01-09 14:22:40,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:22:40,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:40,487 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:22:40,489 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:22:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:22:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:22:40,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:22:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:22:40,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:22:40,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:22:40,599 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:22:40,601 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:22:41,485 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-01-09 14:22:41,485 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:22:41,505 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:22:41,505 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:22:41,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:22:41 BoogieIcfgContainer [2025-01-09 14:22:41,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:22:41,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:22:41,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:22:41,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:22:41,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:22:39" (1/3) ... [2025-01-09 14:22:41,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c42989c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:22:41, skipping insertion in model container [2025-01-09 14:22:41,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:22:40" (2/3) ... [2025-01-09 14:22:41,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c42989c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:22:41, skipping insertion in model container [2025-01-09 14:22:41,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:22:41" (3/3) ... [2025-01-09 14:22:41,518 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-3.i [2025-01-09 14:22:41,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:22:41,534 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-3.i that has 2 procedures, 208 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:22:41,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:22:41,603 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;@37f792af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:22:41,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:22:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 150 states have internal predecessors, (222), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:22:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 14:22:41,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:41,633 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:41,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:41,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash 78109776, now seen corresponding path program 1 times [2025-01-09 14:22:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:41,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403582520] [2025-01-09 14:22:41,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:41,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 14:22:41,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 14:22:41,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:41,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-01-09 14:22:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403582520] [2025-01-09 14:22:42,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403582520] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:42,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750593038] [2025-01-09 14:22:42,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:42,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:42,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:42,179 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:22:42,181 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:22:42,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 14:22:42,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 14:22:42,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:42,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:42,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:22:42,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-01-09 14:22:42,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:22:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750593038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:22:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:22:42,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792384680] [2025-01-09 14:22:42,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:42,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:22:42,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:42,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:22:42,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:22:42,593 INFO L87 Difference]: Start difference. First operand has 208 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 150 states have internal predecessors, (222), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-01-09 14:22:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:42,630 INFO L93 Difference]: Finished difference Result 410 states and 719 transitions. [2025-01-09 14:22:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:22:42,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 372 [2025-01-09 14:22:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:42,640 INFO L225 Difference]: With dead ends: 410 [2025-01-09 14:22:42,640 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 14:22:42,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 373 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:22:42,647 INFO L435 NwaCegarLoop]: 328 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, 328 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:22:42,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:22:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 14:22:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-01-09 14:22:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:22:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 328 transitions. [2025-01-09 14:22:42,711 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 328 transitions. Word has length 372 [2025-01-09 14:22:42,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:42,714 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 328 transitions. [2025-01-09 14:22:42,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-01-09 14:22:42,715 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 328 transitions. [2025-01-09 14:22:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 14:22:42,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:42,725 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:42,735 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:22:42,925 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:22:42,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:42,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash 380197260, now seen corresponding path program 1 times [2025-01-09 14:22:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:42,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119774330] [2025-01-09 14:22:42,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:42,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 14:22:43,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 14:22:43,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:43,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:22:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119774330] [2025-01-09 14:22:43,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119774330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:43,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:43,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:22:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157253586] [2025-01-09 14:22:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:43,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:22:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:43,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:22:43,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:22:43,734 INFO L87 Difference]: Start difference. First operand 205 states and 328 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:44,425 INFO L93 Difference]: Finished difference Result 937 states and 1481 transitions. [2025-01-09 14:22:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:22:44,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-01-09 14:22:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:44,437 INFO L225 Difference]: With dead ends: 937 [2025-01-09 14:22:44,437 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 14:22:44,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:22:44,441 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 884 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:44,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1903 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:22:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 14:22:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 407. [2025-01-09 14:22:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 345 states have (on average 1.5565217391304347) internal successors, (537), 346 states have internal predecessors, (537), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:22:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 655 transitions. [2025-01-09 14:22:44,519 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 655 transitions. Word has length 372 [2025-01-09 14:22:44,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:44,523 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 655 transitions. [2025-01-09 14:22:44,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 655 transitions. [2025-01-09 14:22:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 14:22:44,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:44,532 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:44,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:22:44,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:44,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:44,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1425241074, now seen corresponding path program 1 times [2025-01-09 14:22:44,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:44,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520505066] [2025-01-09 14:22:44,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:44,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 14:22:44,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 14:22:44,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:44,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:22:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520505066] [2025-01-09 14:22:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520505066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:22:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340788224] [2025-01-09 14:22:45,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:45,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:22:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:45,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:22:45,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:22:45,752 INFO L87 Difference]: Start difference. First operand 407 states and 655 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:46,246 INFO L93 Difference]: Finished difference Result 1348 states and 2160 transitions. [2025-01-09 14:22:46,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:22:46,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-01-09 14:22:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:46,254 INFO L225 Difference]: With dead ends: 1348 [2025-01-09 14:22:46,255 INFO L226 Difference]: Without dead ends: 944 [2025-01-09 14:22:46,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:22:46,257 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 555 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:46,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1121 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:22:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-01-09 14:22:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 758. [2025-01-09 14:22:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 663 states have (on average 1.5716440422322775) internal successors, (1042), 666 states have internal predecessors, (1042), 90 states have call successors, (90), 4 states have call predecessors, (90), 4 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 14:22:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1222 transitions. [2025-01-09 14:22:46,327 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1222 transitions. Word has length 372 [2025-01-09 14:22:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:46,329 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1222 transitions. [2025-01-09 14:22:46,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1222 transitions. [2025-01-09 14:22:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 14:22:46,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:46,339 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:46,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:22:46,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:46,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:46,341 INFO L85 PathProgramCache]: Analyzing trace with hash -944160816, now seen corresponding path program 1 times [2025-01-09 14:22:46,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:46,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733001921] [2025-01-09 14:22:46,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:46,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 14:22:46,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 14:22:46,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:46,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:22:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:46,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733001921] [2025-01-09 14:22:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733001921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:46,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:22:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498307177] [2025-01-09 14:22:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:46,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:22:46,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:46,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:22:46,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:22:46,777 INFO L87 Difference]: Start difference. First operand 758 states and 1222 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:47,253 INFO L93 Difference]: Finished difference Result 1948 states and 3118 transitions. [2025-01-09 14:22:47,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:22:47,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-01-09 14:22:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:47,266 INFO L225 Difference]: With dead ends: 1948 [2025-01-09 14:22:47,267 INFO L226 Difference]: Without dead ends: 1193 [2025-01-09 14:22:47,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:22:47,271 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 750 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:47,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1173 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:22:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-01-09 14:22:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1033. [2025-01-09 14:22:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 921 states have (on average 1.5722041259500543) internal successors, (1448), 927 states have internal predecessors, (1448), 103 states have call successors, (103), 8 states have call predecessors, (103), 8 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 14:22:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1654 transitions. [2025-01-09 14:22:47,342 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1654 transitions. Word has length 372 [2025-01-09 14:22:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:47,343 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1654 transitions. [2025-01-09 14:22:47,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1654 transitions. [2025-01-09 14:22:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 14:22:47,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:47,351 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:47,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:22:47,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:47,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1693404750, now seen corresponding path program 1 times [2025-01-09 14:22:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:47,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175960957] [2025-01-09 14:22:47,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:47,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:47,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 14:22:47,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 14:22:47,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:47,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:22:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:48,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175960957] [2025-01-09 14:22:48,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175960957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:48,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:48,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:22:48,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742535177] [2025-01-09 14:22:48,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:22:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:48,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:22:48,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:22:48,329 INFO L87 Difference]: Start difference. First operand 1033 states and 1654 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:48,792 INFO L93 Difference]: Finished difference Result 2382 states and 3793 transitions. [2025-01-09 14:22:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:22:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 372 [2025-01-09 14:22:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:48,804 INFO L225 Difference]: With dead ends: 2382 [2025-01-09 14:22:48,804 INFO L226 Difference]: Without dead ends: 1364 [2025-01-09 14:22:48,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:22:48,808 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 514 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:48,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1265 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:22:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-01-09 14:22:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1037. [2025-01-09 14:22:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 924 states have (on average 1.567099567099567) internal successors, (1448), 930 states have internal predecessors, (1448), 103 states have call successors, (103), 9 states have call predecessors, (103), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 14:22:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1654 transitions. [2025-01-09 14:22:48,893 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1654 transitions. Word has length 372 [2025-01-09 14:22:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:48,894 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1654 transitions. [2025-01-09 14:22:48,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1654 transitions. [2025-01-09 14:22:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-01-09 14:22:48,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:48,903 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:48,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:22:48,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:48,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash -531135054, now seen corresponding path program 1 times [2025-01-09 14:22:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:48,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638802169] [2025-01-09 14:22:48,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:48,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:48,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-01-09 14:22:48,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-01-09 14:22:48,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:48,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:22:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638802169] [2025-01-09 14:22:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638802169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:49,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:49,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:22:49,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587388557] [2025-01-09 14:22:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:49,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:22:49,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:49,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:22:49,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:22:49,374 INFO L87 Difference]: Start difference. First operand 1037 states and 1654 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-01-09 14:22:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:50,443 INFO L93 Difference]: Finished difference Result 3104 states and 4913 transitions. [2025-01-09 14:22:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:22:50,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 373 [2025-01-09 14:22:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:50,455 INFO L225 Difference]: With dead ends: 3104 [2025-01-09 14:22:50,455 INFO L226 Difference]: Without dead ends: 2082 [2025-01-09 14:22:50,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:22:50,460 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 1505 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:50,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 812 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:22:50,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2025-01-09 14:22:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1002. [2025-01-09 14:22:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 893 states have (on average 1.5699888017917134) internal successors, (1402), 897 states have internal predecessors, (1402), 97 states have call successors, (97), 11 states have call predecessors, (97), 11 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2025-01-09 14:22:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1596 transitions. [2025-01-09 14:22:50,535 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1596 transitions. Word has length 373 [2025-01-09 14:22:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:50,537 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1596 transitions. [2025-01-09 14:22:50,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-01-09 14:22:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1596 transitions. [2025-01-09 14:22:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-01-09 14:22:50,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:50,542 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:50,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:22:50,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:50,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -508502800, now seen corresponding path program 1 times [2025-01-09 14:22:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:50,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730524682] [2025-01-09 14:22:50,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:50,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-01-09 14:22:50,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-01-09 14:22:50,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:22:51,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:51,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730524682] [2025-01-09 14:22:51,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730524682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:51,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:51,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:22:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002038496] [2025-01-09 14:22:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:51,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:22:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:51,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:22:51,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:22:51,427 INFO L87 Difference]: Start difference. First operand 1002 states and 1596 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:52,243 INFO L93 Difference]: Finished difference Result 4399 states and 6958 transitions. [2025-01-09 14:22:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:22:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 373 [2025-01-09 14:22:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:52,261 INFO L225 Difference]: With dead ends: 4399 [2025-01-09 14:22:52,262 INFO L226 Difference]: Without dead ends: 3416 [2025-01-09 14:22:52,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:22:52,267 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 921 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:52,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2148 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:22:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2025-01-09 14:22:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3008. [2025-01-09 14:22:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 2760 states have (on average 1.5702898550724638) internal successors, (4334), 2777 states have internal predecessors, (4334), 210 states have call successors, (210), 37 states have call predecessors, (210), 37 states have return successors, (210), 193 states have call predecessors, (210), 210 states have call successors, (210) [2025-01-09 14:22:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4754 transitions. [2025-01-09 14:22:52,484 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4754 transitions. Word has length 373 [2025-01-09 14:22:52,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:52,485 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4754 transitions. [2025-01-09 14:22:52,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:22:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4754 transitions. [2025-01-09 14:22:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 14:22:52,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:52,495 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:52,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:22:52,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2006696660, now seen corresponding path program 1 times [2025-01-09 14:22:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:52,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077866434] [2025-01-09 14:22:52,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:52,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:22:52,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:22:52,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:52,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:22:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077866434] [2025-01-09 14:22:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077866434] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358184281] [2025-01-09 14:22:53,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:53,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:53,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:53,008 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:22:53,014 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:22:53,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:22:53,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:22:53,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:53,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:53,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:22:53,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2895 proven. 105 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2025-01-09 14:22:53,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:22:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358184281] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:22:54,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:22:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-01-09 14:22:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569573289] [2025-01-09 14:22:54,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 14:22:54,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:54,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 14:22:54,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:22:54,475 INFO L87 Difference]: Start difference. First operand 3008 states and 4754 transitions. Second operand has 13 states, 13 states have (on average 17.076923076923077) internal successors, (222), 13 states have internal predecessors, (222), 4 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (143), 4 states have call predecessors, (143), 4 states have call successors, (143) [2025-01-09 14:22:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:56,003 INFO L93 Difference]: Finished difference Result 8310 states and 12900 transitions. [2025-01-09 14:22:56,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 14:22:56,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.076923076923077) internal successors, (222), 13 states have internal predecessors, (222), 4 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (143), 4 states have call predecessors, (143), 4 states have call successors, (143) Word has length 374 [2025-01-09 14:22:56,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:56,030 INFO L225 Difference]: With dead ends: 8310 [2025-01-09 14:22:56,030 INFO L226 Difference]: Without dead ends: 5305 [2025-01-09 14:22:56,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 778 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=926, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 14:22:56,037 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 1819 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:56,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 1020 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:22:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2025-01-09 14:22:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 3745. [2025-01-09 14:22:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3745 states, 3483 states have (on average 1.5633074935400517) internal successors, (5445), 3500 states have internal predecessors, (5445), 210 states have call successors, (210), 51 states have call predecessors, (210), 51 states have return successors, (210), 193 states have call predecessors, (210), 210 states have call successors, (210) [2025-01-09 14:22:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3745 states and 5865 transitions. [2025-01-09 14:22:56,248 INFO L78 Accepts]: Start accepts. Automaton has 3745 states and 5865 transitions. Word has length 374 [2025-01-09 14:22:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:56,249 INFO L471 AbstractCegarLoop]: Abstraction has 3745 states and 5865 transitions. [2025-01-09 14:22:56,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.076923076923077) internal successors, (222), 13 states have internal predecessors, (222), 4 states have call successors, (141), 2 states have call predecessors, (141), 4 states have return successors, (143), 4 states have call predecessors, (143), 4 states have call successors, (143) [2025-01-09 14:22:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3745 states and 5865 transitions. [2025-01-09 14:22:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-01-09 14:22:56,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:56,258 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:56,268 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:22:56,459 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:22:56,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:56,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1980556244, now seen corresponding path program 1 times [2025-01-09 14:22:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169727331] [2025-01-09 14:22:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:56,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:22:56,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:22:56,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:56,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 69 proven. 255 refuted. 0 times theorem prover too weak. 5836 trivial. 0 not checked. [2025-01-09 14:22:57,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:57,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169727331] [2025-01-09 14:22:57,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169727331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583836570] [2025-01-09 14:22:57,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:57,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:57,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:57,465 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:22:57,468 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:22:57,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-01-09 14:22:57,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-01-09 14:22:57,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:57,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:57,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:22:57,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3062 proven. 255 refuted. 0 times theorem prover too weak. 2843 trivial. 0 not checked. [2025-01-09 14:22:58,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:22:59,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583836570] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:22:59,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:22:59,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 24 [2025-01-09 14:22:59,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223811112] [2025-01-09 14:22:59,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:59,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 14:22:59,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:59,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 14:22:59,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:22:59,672 INFO L87 Difference]: Start difference. First operand 3745 states and 5865 transitions. Second operand has 24 states, 24 states have (on average 8.291666666666666) internal successors, (199), 24 states have internal predecessors, (199), 5 states have call successors, (158), 3 states have call predecessors, (158), 6 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) [2025-01-09 14:23:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:03,059 INFO L93 Difference]: Finished difference Result 11190 states and 17079 transitions. [2025-01-09 14:23:03,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-09 14:23:03,060 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.291666666666666) internal successors, (199), 24 states have internal predecessors, (199), 5 states have call successors, (158), 3 states have call predecessors, (158), 6 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) Word has length 374 [2025-01-09 14:23:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:03,096 INFO L225 Difference]: With dead ends: 11190 [2025-01-09 14:23:03,096 INFO L226 Difference]: Without dead ends: 7448 [2025-01-09 14:23:03,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=890, Invalid=2770, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 14:23:03,108 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1935 mSDsluCounter, 2710 mSDsCounter, 0 mSdLazyCounter, 3129 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 3129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:03,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 2919 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 3129 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 14:23:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2025-01-09 14:23:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 2568. [2025-01-09 14:23:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2316 states have (on average 1.5267702936096719) internal successors, (3536), 2325 states have internal predecessors, (3536), 192 states have call successors, (192), 59 states have call predecessors, (192), 59 states have return successors, (192), 183 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 14:23:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3920 transitions. [2025-01-09 14:23:03,317 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3920 transitions. Word has length 374 [2025-01-09 14:23:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:03,319 INFO L471 AbstractCegarLoop]: Abstraction has 2568 states and 3920 transitions. [2025-01-09 14:23:03,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.291666666666666) internal successors, (199), 24 states have internal predecessors, (199), 5 states have call successors, (158), 3 states have call predecessors, (158), 6 states have return successors, (159), 5 states have call predecessors, (159), 5 states have call successors, (159) [2025-01-09 14:23:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3920 transitions. [2025-01-09 14:23:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:23:03,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:03,326 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:23:03,337 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:23:03,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:23:03,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:03,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1475301108, now seen corresponding path program 1 times [2025-01-09 14:23:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:03,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364096347] [2025-01-09 14:23:03,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:03,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:03,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:03,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:03,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:23:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364096347] [2025-01-09 14:23:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364096347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:23:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:23:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:23:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749117874] [2025-01-09 14:23:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:23:04,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:23:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:23:04,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:23:04,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:23:04,056 INFO L87 Difference]: Start difference. First operand 2568 states and 3920 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-01-09 14:23:05,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:05,625 INFO L93 Difference]: Finished difference Result 6712 states and 10305 transitions. [2025-01-09 14:23:05,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 14:23:05,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 375 [2025-01-09 14:23:05,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:05,645 INFO L225 Difference]: With dead ends: 6712 [2025-01-09 14:23:05,645 INFO L226 Difference]: Without dead ends: 4147 [2025-01-09 14:23:05,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:23:05,653 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1770 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:05,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1770 Valid, 1461 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 14:23:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4147 states. [2025-01-09 14:23:05,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4147 to 2659. [2025-01-09 14:23:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2407 states have (on average 1.5284586622351475) internal successors, (3679), 2416 states have internal predecessors, (3679), 192 states have call successors, (192), 59 states have call predecessors, (192), 59 states have return successors, (192), 183 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 14:23:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 4063 transitions. [2025-01-09 14:23:05,832 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 4063 transitions. Word has length 375 [2025-01-09 14:23:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:05,833 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 4063 transitions. [2025-01-09 14:23:05,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 3 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-01-09 14:23:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 4063 transitions. [2025-01-09 14:23:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:23:05,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:05,840 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:23:05,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:23:05,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:05,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:05,841 INFO L85 PathProgramCache]: Analyzing trace with hash 553335122, now seen corresponding path program 1 times [2025-01-09 14:23:05,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:05,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406112575] [2025-01-09 14:23:05,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:05,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:05,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:05,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:05,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:23:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406112575] [2025-01-09 14:23:06,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406112575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:23:06,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:23:06,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:23:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556686891] [2025-01-09 14:23:06,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:23:06,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:23:06,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:23:06,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:23:06,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:23:06,653 INFO L87 Difference]: Start difference. First operand 2659 states and 4063 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:23:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:07,205 INFO L93 Difference]: Finished difference Result 6376 states and 9723 transitions. [2025-01-09 14:23:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:23:07,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2025-01-09 14:23:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:07,235 INFO L225 Difference]: With dead ends: 6376 [2025-01-09 14:23:07,235 INFO L226 Difference]: Without dead ends: 3720 [2025-01-09 14:23:07,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:23:07,243 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 203 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:07,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1397 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:23:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2025-01-09 14:23:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 2725. [2025-01-09 14:23:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 2473 states have (on average 1.5289122523251113) internal successors, (3781), 2482 states have internal predecessors, (3781), 192 states have call successors, (192), 59 states have call predecessors, (192), 59 states have return successors, (192), 183 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 14:23:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4165 transitions. [2025-01-09 14:23:07,471 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4165 transitions. Word has length 375 [2025-01-09 14:23:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:07,472 INFO L471 AbstractCegarLoop]: Abstraction has 2725 states and 4165 transitions. [2025-01-09 14:23:07,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:23:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4165 transitions. [2025-01-09 14:23:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:23:07,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:07,480 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:23:07,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:23:07,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:07,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1862020208, now seen corresponding path program 1 times [2025-01-09 14:23:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:07,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89727430] [2025-01-09 14:23:07,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:07,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:07,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:07,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:07,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:07,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:23:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89727430] [2025-01-09 14:23:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89727430] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:23:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126151675] [2025-01-09 14:23:08,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:08,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:23:08,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:23:08,251 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:23:08,253 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:23:08,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:08,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:08,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:08,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:08,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 14:23:08,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:23:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3780 proven. 180 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2025-01-09 14:23:09,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:23:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:23:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126151675] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:23:10,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:23:10,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 19 [2025-01-09 14:23:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418654951] [2025-01-09 14:23:10,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:23:10,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 14:23:10,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:23:10,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 14:23:10,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-01-09 14:23:10,039 INFO L87 Difference]: Start difference. First operand 2725 states and 4165 transitions. Second operand has 19 states, 19 states have (on average 10.210526315789474) internal successors, (194), 19 states have internal predecessors, (194), 5 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (127), 5 states have call predecessors, (127), 5 states have call successors, (127) [2025-01-09 14:23:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:11,815 INFO L93 Difference]: Finished difference Result 5750 states and 8662 transitions. [2025-01-09 14:23:11,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 14:23:11,815 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 10.210526315789474) internal successors, (194), 19 states have internal predecessors, (194), 5 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (127), 5 states have call predecessors, (127), 5 states have call successors, (127) Word has length 375 [2025-01-09 14:23:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:11,826 INFO L225 Difference]: With dead ends: 5750 [2025-01-09 14:23:11,826 INFO L226 Difference]: Without dead ends: 3028 [2025-01-09 14:23:11,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=1249, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 14:23:11,833 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 832 mSDsluCounter, 3057 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:11,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 3626 Invalid, 2320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 14:23:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2025-01-09 14:23:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2372. [2025-01-09 14:23:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 2119 states have (on average 1.4959886739027843) internal successors, (3170), 2128 states have internal predecessors, (3170), 192 states have call successors, (192), 60 states have call predecessors, (192), 60 states have return successors, (192), 183 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 14:23:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3554 transitions. [2025-01-09 14:23:12,032 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3554 transitions. Word has length 375 [2025-01-09 14:23:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:12,033 INFO L471 AbstractCegarLoop]: Abstraction has 2372 states and 3554 transitions. [2025-01-09 14:23:12,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.210526315789474) internal successors, (194), 19 states have internal predecessors, (194), 5 states have call successors, (126), 3 states have call predecessors, (126), 6 states have return successors, (127), 5 states have call predecessors, (127), 5 states have call successors, (127) [2025-01-09 14:23:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3554 transitions. [2025-01-09 14:23:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:23:12,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:12,039 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:23:12,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:23:12,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 14:23:12,243 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1031400434, now seen corresponding path program 1 times [2025-01-09 14:23:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994925690] [2025-01-09 14:23:12,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:12,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:12,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:12,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:12,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:23:12,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994925690] [2025-01-09 14:23:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994925690] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:23:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61741231] [2025-01-09 14:23:12,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:12,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:23:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:23:12,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:23:12,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:23:12,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:12,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:12,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:23:12,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:23:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 1729 proven. 138 refuted. 0 times theorem prover too weak. 4293 trivial. 0 not checked. [2025-01-09 14:23:13,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:23:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:23:13,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61741231] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:23:13,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:23:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 14:23:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641282888] [2025-01-09 14:23:13,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:23:13,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:23:13,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:23:13,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:23:13,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:23:13,605 INFO L87 Difference]: Start difference. First operand 2372 states and 3554 transitions. Second operand has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) [2025-01-09 14:23:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:14,219 INFO L93 Difference]: Finished difference Result 4382 states and 6535 transitions. [2025-01-09 14:23:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:23:14,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) Word has length 375 [2025-01-09 14:23:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:14,227 INFO L225 Difference]: With dead ends: 4382 [2025-01-09 14:23:14,227 INFO L226 Difference]: Without dead ends: 2013 [2025-01-09 14:23:14,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=308, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:23:14,232 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 1088 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:14,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 973 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:23:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2025-01-09 14:23:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1844. [2025-01-09 14:23:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1628 states have (on average 1.4668304668304668) internal successors, (2388), 1635 states have internal predecessors, (2388), 161 states have call successors, (161), 54 states have call predecessors, (161), 54 states have return successors, (161), 154 states have call predecessors, (161), 161 states have call successors, (161) [2025-01-09 14:23:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2710 transitions. [2025-01-09 14:23:14,392 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2710 transitions. Word has length 375 [2025-01-09 14:23:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:14,398 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2710 transitions. [2025-01-09 14:23:14,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.272727272727273) internal successors, (168), 11 states have internal predecessors, (168), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) [2025-01-09 14:23:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2710 transitions. [2025-01-09 14:23:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:23:14,407 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:14,407 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:23:14,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:23:14,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 14:23:14,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:14,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash -72806827, now seen corresponding path program 1 times [2025-01-09 14:23:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:14,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219910510] [2025-01-09 14:23:14,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:14,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:14,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:14,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:14,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:14,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:23:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219910510] [2025-01-09 14:23:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219910510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:23:15,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:23:15,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:23:15,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275643184] [2025-01-09 14:23:15,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:23:15,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:23:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:23:15,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:23:15,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:23:15,435 INFO L87 Difference]: Start difference. First operand 1844 states and 2710 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:23:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:23:16,419 INFO L93 Difference]: Finished difference Result 4958 states and 7119 transitions. [2025-01-09 14:23:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:23:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2025-01-09 14:23:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:23:16,429 INFO L225 Difference]: With dead ends: 4958 [2025-01-09 14:23:16,429 INFO L226 Difference]: Without dead ends: 3117 [2025-01-09 14:23:16,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:23:16,445 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1276 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:23:16,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1679 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:23:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3117 states. [2025-01-09 14:23:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3117 to 1981. [2025-01-09 14:23:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1765 states have (on average 1.4611898016997167) internal successors, (2579), 1772 states have internal predecessors, (2579), 161 states have call successors, (161), 54 states have call predecessors, (161), 54 states have return successors, (161), 154 states have call predecessors, (161), 161 states have call successors, (161) [2025-01-09 14:23:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2901 transitions. [2025-01-09 14:23:16,577 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2901 transitions. Word has length 375 [2025-01-09 14:23:16,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:23:16,578 INFO L471 AbstractCegarLoop]: Abstraction has 1981 states and 2901 transitions. [2025-01-09 14:23:16,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:23:16,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2901 transitions. [2025-01-09 14:23:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 14:23:16,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:23:16,583 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:23:16,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:23:16,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:23:16,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:23:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1878245161, now seen corresponding path program 1 times [2025-01-09 14:23:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:23:16,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771459841] [2025-01-09 14:23:16,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:23:16,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:16,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:16,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:16,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 27 proven. 138 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:23:17,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:23:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771459841] [2025-01-09 14:23:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771459841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:23:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274281486] [2025-01-09 14:23:17,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:23:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:23:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:23:17,131 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:23:17,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:23:17,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 14:23:17,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 14:23:17,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:23:17,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:23:17,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:23:17,440 INFO L279 TraceCheckSpWp]: Computing forward predicates...