./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.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 465302550670ddfe2aca9dabc319e04462635a8aa1413623f09c27b5df4d6427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:38:39,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:38:39,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:38:39,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:38:39,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:38:39,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:38:39,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:38:39,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:38:39,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:38:40,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:38:40,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:38:40,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:38:40,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:38:40,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:38:40,000 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:38:40,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:38:40,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:38:40,000 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:38:40,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:38:40,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:38:40,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:38:40,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:38:40,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:38:40,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:38:40,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:38:40,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:38:40,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:38:40,002 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:38:40,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:38:40,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:38:40,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:38:40,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:38:40,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:38:40,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:38:40,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:38:40,003 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 -> 465302550670ddfe2aca9dabc319e04462635a8aa1413623f09c27b5df4d6427 [2025-01-09 09:38:40,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:38:40,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:38:40,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:38:40,212 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:38:40,212 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:38:40,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-01-09 09:38:41,519 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e9b6c928/aee5d48fe80148f1a738887061b15773/FLAG57605249d [2025-01-09 09:38:41,877 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:38:41,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-01-09 09:38:41,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e9b6c928/aee5d48fe80148f1a738887061b15773/FLAG57605249d [2025-01-09 09:38:41,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e9b6c928/aee5d48fe80148f1a738887061b15773 [2025-01-09 09:38:41,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:38:41,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:38:41,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:38:41,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:38:41,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:38:41,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:38:41" (1/1) ... [2025-01-09 09:38:41,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294e1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:41, skipping insertion in model container [2025-01-09 09:38:41,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:38:41" (1/1) ... [2025-01-09 09:38:41,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:38:42,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i[915,928] [2025-01-09 09:38:42,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:38:42,166 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:38:42,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i[915,928] [2025-01-09 09:38:42,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:38:42,251 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:38:42,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42 WrapperNode [2025-01-09 09:38:42,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:38:42,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:38:42,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:38:42,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:38:42,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,307 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2025-01-09 09:38:42,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:38:42,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:38:42,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:38:42,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:38:42,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,339 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:38:42,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:38:42,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:38:42,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:38:42,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:38:42,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (1/1) ... [2025-01-09 09:38:42,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:38:42,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:38:42,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:38:42,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:38:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:38:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:38:42,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:38:42,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:38:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:38:42,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:38:42,538 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:38:42,539 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:38:43,301 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 09:38:43,301 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:38:43,315 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:38:43,315 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:38:43,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:38:43 BoogieIcfgContainer [2025-01-09 09:38:43,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:38:43,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:38:43,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:38:43,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:38:43,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:38:41" (1/3) ... [2025-01-09 09:38:43,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f66adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:38:43, skipping insertion in model container [2025-01-09 09:38:43,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:38:42" (2/3) ... [2025-01-09 09:38:43,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f66adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:38:43, skipping insertion in model container [2025-01-09 09:38:43,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:38:43" (3/3) ... [2025-01-09 09:38:43,326 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-01-09 09:38:43,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:38:43,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-0.i that has 2 procedures, 202 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:38:43,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:38:43,392 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;@7a1e0ca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:38:43,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:38:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 128 states have internal predecessors, (193), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:38:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:43,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:43,413 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:43,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:43,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:43,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1015146968, now seen corresponding path program 1 times [2025-01-09 09:38:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761357067] [2025-01-09 09:38:43,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:43,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:43,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:43,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:43,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:43,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-01-09 09:38:44,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:44,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761357067] [2025-01-09 09:38:44,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761357067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:38:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710245910] [2025-01-09 09:38:44,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:44,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:38:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:38:44,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:38:44,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:38:44,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:44,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:44,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:44,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:44,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:38:44,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:38:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-01-09 09:38:44,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:38:44,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710245910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:44,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:38:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:38:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969057656] [2025-01-09 09:38:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:44,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:38:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:44,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:38:44,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:38:44,391 INFO L87 Difference]: Start difference. First operand has 202 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 128 states have internal predecessors, (193), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 09:38:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:44,453 INFO L93 Difference]: Finished difference Result 398 states and 741 transitions. [2025-01-09 09:38:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:38:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 457 [2025-01-09 09:38:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:44,460 INFO L225 Difference]: With dead ends: 398 [2025-01-09 09:38:44,460 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 09:38:44,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 458 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 09:38:44,467 INFO L435 NwaCegarLoop]: 332 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, 332 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 09:38:44,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:38:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 09:38:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-01-09 09:38:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:38:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 332 transitions. [2025-01-09 09:38:44,517 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 332 transitions. Word has length 457 [2025-01-09 09:38:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:44,518 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 332 transitions. [2025-01-09 09:38:44,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 09:38:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 332 transitions. [2025-01-09 09:38:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:44,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:44,526 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:44,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:38:44,726 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 09:38:44,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:44,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash 232658488, now seen corresponding path program 1 times [2025-01-09 09:38:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046640204] [2025-01-09 09:38:44,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:44,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:44,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:44,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:44,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:38:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046640204] [2025-01-09 09:38:45,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046640204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:45,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:45,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:38:45,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172404829] [2025-01-09 09:38:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:45,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:38:45,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:45,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:38:45,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:38:45,116 INFO L87 Difference]: Start difference. First operand 199 states and 332 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:45,203 INFO L93 Difference]: Finished difference Result 556 states and 922 transitions. [2025-01-09 09:38:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:38:45,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-01-09 09:38:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:45,211 INFO L225 Difference]: With dead ends: 556 [2025-01-09 09:38:45,211 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 09:38:45,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:38:45,214 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 251 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:45,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 848 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:38:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 09:38:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 216. [2025-01-09 09:38:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 142 states have internal predecessors, (219), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:38:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 363 transitions. [2025-01-09 09:38:45,245 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 363 transitions. Word has length 457 [2025-01-09 09:38:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:45,247 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 363 transitions. [2025-01-09 09:38:45,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 363 transitions. [2025-01-09 09:38:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:45,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:45,253 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:45,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:38:45,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:45,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash 507418102, now seen corresponding path program 1 times [2025-01-09 09:38:45,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:45,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530687935] [2025-01-09 09:38:45,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:45,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:45,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:45,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:45,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:38:45,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:45,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530687935] [2025-01-09 09:38:45,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530687935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:45,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:45,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:38:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640752901] [2025-01-09 09:38:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:45,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:38:45,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:45,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:38:45,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:38:45,592 INFO L87 Difference]: Start difference. First operand 216 states and 363 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:45,653 INFO L93 Difference]: Finished difference Result 573 states and 951 transitions. [2025-01-09 09:38:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:38:45,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-01-09 09:38:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:45,661 INFO L225 Difference]: With dead ends: 573 [2025-01-09 09:38:45,663 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 09:38:45,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:38:45,664 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 249 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:45,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 675 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:38:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 09:38:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 216. [2025-01-09 09:38:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 142 states have (on average 1.528169014084507) internal successors, (217), 142 states have internal predecessors, (217), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:38:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 361 transitions. [2025-01-09 09:38:45,702 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 361 transitions. Word has length 457 [2025-01-09 09:38:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 361 transitions. [2025-01-09 09:38:45,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 361 transitions. [2025-01-09 09:38:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:45,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:45,713 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:45,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:38:45,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 930119928, now seen corresponding path program 1 times [2025-01-09 09:38:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420857409] [2025-01-09 09:38:45,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:45,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:45,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:45,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:45,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:38:46,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:46,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420857409] [2025-01-09 09:38:46,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420857409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:46,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:46,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:38:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392976955] [2025-01-09 09:38:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:46,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:38:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:46,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:38:46,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:38:46,365 INFO L87 Difference]: Start difference. First operand 216 states and 361 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:46,785 INFO L93 Difference]: Finished difference Result 643 states and 1078 transitions. [2025-01-09 09:38:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:38:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-01-09 09:38:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:46,789 INFO L225 Difference]: With dead ends: 643 [2025-01-09 09:38:46,789 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 09:38:46,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:38:46,790 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 262 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:46,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1145 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:38:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 09:38:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 413. [2025-01-09 09:38:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 266 states have (on average 1.5338345864661653) internal successors, (408), 266 states have internal predecessors, (408), 144 states have call successors, (144), 2 states have call predecessors, (144), 2 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 09:38:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 696 transitions. [2025-01-09 09:38:46,826 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 696 transitions. Word has length 457 [2025-01-09 09:38:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:46,827 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 696 transitions. [2025-01-09 09:38:46,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 696 transitions. [2025-01-09 09:38:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:46,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:46,832 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:38:46,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 343313914, now seen corresponding path program 1 times [2025-01-09 09:38:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403197069] [2025-01-09 09:38:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:46,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:47,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:47,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:47,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:38:47,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:47,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403197069] [2025-01-09 09:38:47,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403197069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:47,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:47,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:38:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185331799] [2025-01-09 09:38:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:47,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:38:47,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:47,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:38:47,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:38:47,612 INFO L87 Difference]: Start difference. First operand 413 states and 696 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:47,891 INFO L93 Difference]: Finished difference Result 856 states and 1434 transitions. [2025-01-09 09:38:47,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:38:47,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-01-09 09:38:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:47,895 INFO L225 Difference]: With dead ends: 856 [2025-01-09 09:38:47,896 INFO L226 Difference]: Without dead ends: 640 [2025-01-09 09:38:47,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:38:47,897 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 298 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:47,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 984 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:38:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-01-09 09:38:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 624. [2025-01-09 09:38:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 404 states have (on average 1.5321782178217822) internal successors, (619), 404 states have internal predecessors, (619), 216 states have call successors, (216), 3 states have call predecessors, (216), 3 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 09:38:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1051 transitions. [2025-01-09 09:38:47,975 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1051 transitions. Word has length 457 [2025-01-09 09:38:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:47,976 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 1051 transitions. [2025-01-09 09:38:47,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1051 transitions. [2025-01-09 09:38:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:47,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:47,978 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:47,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:38:47,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash -677754440, now seen corresponding path program 1 times [2025-01-09 09:38:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:47,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877001370] [2025-01-09 09:38:47,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:47,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:48,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:48,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:48,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:48,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:38:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877001370] [2025-01-09 09:38:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877001370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:48,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:38:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032171246] [2025-01-09 09:38:48,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:48,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:38:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:48,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:38:48,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:38:48,664 INFO L87 Difference]: Start difference. First operand 624 states and 1051 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:49,186 INFO L93 Difference]: Finished difference Result 1889 states and 3159 transitions. [2025-01-09 09:38:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:38:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-01-09 09:38:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:49,197 INFO L225 Difference]: With dead ends: 1889 [2025-01-09 09:38:49,197 INFO L226 Difference]: Without dead ends: 1440 [2025-01-09 09:38:49,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:38:49,200 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 641 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:49,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1221 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:38:49,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2025-01-09 09:38:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1030. [2025-01-09 09:38:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 779 states have (on average 1.644415917843389) internal successors, (1281), 781 states have internal predecessors, (1281), 244 states have call successors, (244), 6 states have call predecessors, (244), 6 states have return successors, (244), 242 states have call predecessors, (244), 244 states have call successors, (244) [2025-01-09 09:38:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1769 transitions. [2025-01-09 09:38:49,312 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1769 transitions. Word has length 457 [2025-01-09 09:38:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:49,337 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1769 transitions. [2025-01-09 09:38:49,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1769 transitions. [2025-01-09 09:38:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:49,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:49,340 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:49,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:38:49,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:49,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1261407606, now seen corresponding path program 1 times [2025-01-09 09:38:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314088106] [2025-01-09 09:38:49,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:49,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:49,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:49,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:49,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:49,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:38:49,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:49,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314088106] [2025-01-09 09:38:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314088106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:49,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:38:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112863244] [2025-01-09 09:38:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:49,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:38:49,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:49,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:38:49,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:38:49,659 INFO L87 Difference]: Start difference. First operand 1030 states and 1769 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:49,763 INFO L93 Difference]: Finished difference Result 2641 states and 4536 transitions. [2025-01-09 09:38:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:38:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-01-09 09:38:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:49,774 INFO L225 Difference]: With dead ends: 2641 [2025-01-09 09:38:49,775 INFO L226 Difference]: Without dead ends: 1789 [2025-01-09 09:38:49,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:38:49,778 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 205 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:49,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 766 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:38:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2025-01-09 09:38:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1787. [2025-01-09 09:38:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1360 states have (on average 1.636764705882353) internal successors, (2226), 1364 states have internal predecessors, (2226), 416 states have call successors, (416), 10 states have call predecessors, (416), 10 states have return successors, (416), 412 states have call predecessors, (416), 416 states have call successors, (416) [2025-01-09 09:38:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 3058 transitions. [2025-01-09 09:38:49,942 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 3058 transitions. Word has length 457 [2025-01-09 09:38:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:49,943 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 3058 transitions. [2025-01-09 09:38:49,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 3058 transitions. [2025-01-09 09:38:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:49,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:49,946 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:49,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:38:49,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:49,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1158834698, now seen corresponding path program 1 times [2025-01-09 09:38:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:49,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56181489] [2025-01-09 09:38:49,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:50,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:50,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:50,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:38:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:50,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56181489] [2025-01-09 09:38:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56181489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:50,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:50,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:38:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514576240] [2025-01-09 09:38:50,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:50,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:38:50,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:50,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:38:50,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:38:50,680 INFO L87 Difference]: Start difference. First operand 1787 states and 3058 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:51,905 INFO L93 Difference]: Finished difference Result 8882 states and 15080 transitions. [2025-01-09 09:38:51,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:38:51,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-01-09 09:38:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:51,944 INFO L225 Difference]: With dead ends: 8882 [2025-01-09 09:38:51,945 INFO L226 Difference]: Without dead ends: 7313 [2025-01-09 09:38:51,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:38:51,954 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1289 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:51,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1543 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:38:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2025-01-09 09:38:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 3685. [2025-01-09 09:38:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 2906 states have (on average 1.657604955264969) internal successors, (4817), 2914 states have internal predecessors, (4817), 760 states have call successors, (760), 18 states have call predecessors, (760), 18 states have return successors, (760), 752 states have call predecessors, (760), 760 states have call successors, (760) [2025-01-09 09:38:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 6337 transitions. [2025-01-09 09:38:52,371 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 6337 transitions. Word has length 457 [2025-01-09 09:38:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:52,372 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 6337 transitions. [2025-01-09 09:38:52,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:38:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 6337 transitions. [2025-01-09 09:38:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-09 09:38:52,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:52,377 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:52,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:38:52,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:52,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1107546488, now seen corresponding path program 1 times [2025-01-09 09:38:52,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:52,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722756131] [2025-01-09 09:38:52,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:52,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:52,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:52,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:52,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-01-09 09:38:53,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722756131] [2025-01-09 09:38:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722756131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:38:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769551095] [2025-01-09 09:38:53,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:53,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:38:53,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:38:53,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:38:53,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:38:53,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-09 09:38:53,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-09 09:38:53,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:53,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:53,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 09:38:53,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:38:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 3618 proven. 366 refuted. 0 times theorem prover too weak. 6240 trivial. 0 not checked. [2025-01-09 09:38:54,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:38:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-01-09 09:38:54,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769551095] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:38:54,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:38:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 11] total 18 [2025-01-09 09:38:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994828448] [2025-01-09 09:38:54,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:38:54,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 09:38:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:54,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 09:38:54,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:38:54,991 INFO L87 Difference]: Start difference. First operand 3685 states and 6337 transitions. Second operand has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 2 states have call predecessors, (128), 2 states have call successors, (128) [2025-01-09 09:38:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:38:56,631 INFO L93 Difference]: Finished difference Result 6874 states and 11711 transitions. [2025-01-09 09:38:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 09:38:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 2 states have call predecessors, (128), 2 states have call successors, (128) Word has length 457 [2025-01-09 09:38:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:38:56,651 INFO L225 Difference]: With dead ends: 6874 [2025-01-09 09:38:56,652 INFO L226 Difference]: Without dead ends: 3582 [2025-01-09 09:38:56,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 905 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 09:38:56,665 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 1411 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 1215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1215 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:38:56,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 1653 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1215 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:38:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3582 states. [2025-01-09 09:38:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3582 to 1255. [2025-01-09 09:38:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 879 states have (on average 1.5540386803185438) internal successors, (1366), 879 states have internal predecessors, (1366), 360 states have call successors, (360), 15 states have call predecessors, (360), 15 states have return successors, (360), 360 states have call predecessors, (360), 360 states have call successors, (360) [2025-01-09 09:38:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2086 transitions. [2025-01-09 09:38:56,850 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2086 transitions. Word has length 457 [2025-01-09 09:38:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:38:56,852 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 2086 transitions. [2025-01-09 09:38:56,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 2 states have call predecessors, (128), 2 states have call successors, (128) [2025-01-09 09:38:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2086 transitions. [2025-01-09 09:38:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 09:38:56,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:38:56,854 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:38:56,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 09:38:57,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:38:57,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:38:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:38:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2111733204, now seen corresponding path program 1 times [2025-01-09 09:38:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:38:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844445003] [2025-01-09 09:38:57,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:38:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:38:57,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 09:38:57,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 09:38:57,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:38:57,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:38:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:38:58,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:38:58,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844445003] [2025-01-09 09:38:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844445003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:38:58,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:38:58,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 09:38:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814161389] [2025-01-09 09:38:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:38:58,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:38:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:38:58,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:38:58,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:38:58,127 INFO L87 Difference]: Start difference. First operand 1255 states and 2086 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:39:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:00,062 INFO L93 Difference]: Finished difference Result 5665 states and 9227 transitions. [2025-01-09 09:39:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:39:00,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 458 [2025-01-09 09:39:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:00,082 INFO L225 Difference]: With dead ends: 5665 [2025-01-09 09:39:00,082 INFO L226 Difference]: Without dead ends: 4663 [2025-01-09 09:39:00,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:39:00,087 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 1049 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:00,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1582 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 09:39:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2025-01-09 09:39:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 2806. [2025-01-09 09:39:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 2113 states have (on average 1.5622337908187411) internal successors, (3301), 2121 states have internal predecessors, (3301), 648 states have call successors, (648), 44 states have call predecessors, (648), 44 states have return successors, (648), 640 states have call predecessors, (648), 648 states have call successors, (648) [2025-01-09 09:39:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4597 transitions. [2025-01-09 09:39:00,426 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4597 transitions. Word has length 458 [2025-01-09 09:39:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:00,428 INFO L471 AbstractCegarLoop]: Abstraction has 2806 states and 4597 transitions. [2025-01-09 09:39:00,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-01-09 09:39:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4597 transitions. [2025-01-09 09:39:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 09:39:00,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:00,431 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:39:00,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:39:00,435 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:00,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1481634218, now seen corresponding path program 1 times [2025-01-09 09:39:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:00,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722927522] [2025-01-09 09:39:00,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:00,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 09:39:00,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 09:39:00,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:00,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 57 proven. 156 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-01-09 09:39:00,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:00,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722927522] [2025-01-09 09:39:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722927522] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:39:00,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12189713] [2025-01-09 09:39:00,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:39:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:00,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:39:00,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:39:00,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 09:39:01,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 09:39:01,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:01,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:01,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:39:01,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:39:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4061 proven. 156 refuted. 0 times theorem prover too weak. 6007 trivial. 0 not checked. [2025-01-09 09:39:01,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:39:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 57 proven. 156 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-01-09 09:39:01,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12189713] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:39:01,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:39:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 09:39:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82918356] [2025-01-09 09:39:01,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:39:01,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:39:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:01,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:39:01,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:39:01,870 INFO L87 Difference]: Start difference. First operand 2806 states and 4597 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-01-09 09:39:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:02,295 INFO L93 Difference]: Finished difference Result 4758 states and 7753 transitions. [2025-01-09 09:39:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:39:02,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) Word has length 458 [2025-01-09 09:39:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:02,319 INFO L225 Difference]: With dead ends: 4758 [2025-01-09 09:39:02,319 INFO L226 Difference]: Without dead ends: 2244 [2025-01-09 09:39:02,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 913 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:39:02,328 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 151 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:02,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 606 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:39:02,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2025-01-09 09:39:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 2098. [2025-01-09 09:39:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 1564 states have (on average 1.5594629156010231) internal successors, (2439), 1568 states have internal predecessors, (2439), 496 states have call successors, (496), 37 states have call predecessors, (496), 37 states have return successors, (496), 492 states have call predecessors, (496), 496 states have call successors, (496) [2025-01-09 09:39:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 3431 transitions. [2025-01-09 09:39:02,588 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 3431 transitions. Word has length 458 [2025-01-09 09:39:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 3431 transitions. [2025-01-09 09:39:02,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-01-09 09:39:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 3431 transitions. [2025-01-09 09:39:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 09:39:02,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:02,597 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:39:02,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:39:02,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:39:02,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:02,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:02,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1339228590, now seen corresponding path program 1 times [2025-01-09 09:39:02,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:02,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051367778] [2025-01-09 09:39:02,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:02,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 09:39:02,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 09:39:02,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:02,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:39:02,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:02,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051367778] [2025-01-09 09:39:02,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051367778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:02,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:02,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:39:02,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101455026] [2025-01-09 09:39:02,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:02,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:39:02,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:02,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:39:02,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:39:02,995 INFO L87 Difference]: Start difference. First operand 2098 states and 3431 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 09:39:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:03,528 INFO L93 Difference]: Finished difference Result 5014 states and 8097 transitions. [2025-01-09 09:39:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:39:03,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 458 [2025-01-09 09:39:03,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:03,547 INFO L225 Difference]: With dead ends: 5014 [2025-01-09 09:39:03,547 INFO L226 Difference]: Without dead ends: 3280 [2025-01-09 09:39:03,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:39:03,552 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 476 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:03,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 780 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:39:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2025-01-09 09:39:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 3274. [2025-01-09 09:39:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3274 states, 2412 states have (on average 1.5103648424543947) internal successors, (3643), 2424 states have internal predecessors, (3643), 792 states have call successors, (792), 69 states have call predecessors, (792), 69 states have return successors, (792), 780 states have call predecessors, (792), 792 states have call successors, (792) [2025-01-09 09:39:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 5227 transitions. [2025-01-09 09:39:03,917 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 5227 transitions. Word has length 458 [2025-01-09 09:39:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:03,918 INFO L471 AbstractCegarLoop]: Abstraction has 3274 states and 5227 transitions. [2025-01-09 09:39:03,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 09:39:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 5227 transitions. [2025-01-09 09:39:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-09 09:39:03,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:03,922 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:39:03,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:39:03,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:03,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 637628716, now seen corresponding path program 1 times [2025-01-09 09:39:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:03,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907813865] [2025-01-09 09:39:03,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:03,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:03,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 09:39:04,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 09:39:04,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:04,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 42 proven. 171 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-01-09 09:39:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:04,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907813865] [2025-01-09 09:39:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907813865] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:39:04,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097056403] [2025-01-09 09:39:04,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:04,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:39:04,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:04,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:39:04,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 09:39:04,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-09 09:39:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-09 09:39:04,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:04,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:04,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 09:39:04,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:39:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4149 proven. 657 refuted. 0 times theorem prover too weak. 5418 trivial. 0 not checked. [2025-01-09 09:39:06,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:39:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 162 proven. 468 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-01-09 09:39:07,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097056403] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:39:07,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:39:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 13] total 23 [2025-01-09 09:39:07,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359781720] [2025-01-09 09:39:07,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:39:07,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 09:39:07,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:07,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 09:39:07,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2025-01-09 09:39:07,034 INFO L87 Difference]: Start difference. First operand 3274 states and 5227 transitions. Second operand has 23 states, 23 states have (on average 8.608695652173912) internal successors, (198), 23 states have internal predecessors, (198), 5 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (186), 5 states have call predecessors, (186), 5 states have call successors, (186) [2025-01-09 09:39:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:09,848 INFO L93 Difference]: Finished difference Result 5489 states and 8562 transitions. [2025-01-09 09:39:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 09:39:09,849 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.608695652173912) internal successors, (198), 23 states have internal predecessors, (198), 5 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (186), 5 states have call predecessors, (186), 5 states have call successors, (186) Word has length 458 [2025-01-09 09:39:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:09,859 INFO L225 Difference]: With dead ends: 5489 [2025-01-09 09:39:09,859 INFO L226 Difference]: Without dead ends: 2483 [2025-01-09 09:39:09,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 906 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1497, Invalid=4509, Unknown=0, NotChecked=0, Total=6006 [2025-01-09 09:39:09,867 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 2901 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 743 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2901 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 743 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:09,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2901 Valid, 1550 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [743 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 09:39:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2025-01-09 09:39:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1537. [2025-01-09 09:39:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1040 states have (on average 1.3798076923076923) internal successors, (1435), 1046 states have internal predecessors, (1435), 432 states have call successors, (432), 64 states have call predecessors, (432), 64 states have return successors, (432), 426 states have call predecessors, (432), 432 states have call successors, (432) [2025-01-09 09:39:10,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2299 transitions. [2025-01-09 09:39:10,129 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2299 transitions. Word has length 458 [2025-01-09 09:39:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:10,129 INFO L471 AbstractCegarLoop]: Abstraction has 1537 states and 2299 transitions. [2025-01-09 09:39:10,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.608695652173912) internal successors, (198), 23 states have internal predecessors, (198), 5 states have call successors, (183), 4 states have call predecessors, (183), 10 states have return successors, (186), 5 states have call predecessors, (186), 5 states have call successors, (186) [2025-01-09 09:39:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2299 transitions. [2025-01-09 09:39:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-09 09:39:10,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:10,132 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:39:10,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 09:39:10,336 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,SelfDestructingSolverStorable12 [2025-01-09 09:39:10,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1029905722, now seen corresponding path program 1 times [2025-01-09 09:39:10,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:10,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661443994] [2025-01-09 09:39:10,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:10,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:10,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 09:39:10,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 09:39:10,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:10,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:39:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:13,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661443994] [2025-01-09 09:39:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661443994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:13,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:13,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:39:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149869445] [2025-01-09 09:39:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:13,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:39:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:13,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:39:13,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:39:13,182 INFO L87 Difference]: Start difference. First operand 1537 states and 2299 transitions. Second operand has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-01-09 09:39:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:21,114 INFO L93 Difference]: Finished difference Result 13629 states and 19439 transitions. [2025-01-09 09:39:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:39:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) Word has length 460 [2025-01-09 09:39:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:21,210 INFO L225 Difference]: With dead ends: 13629 [2025-01-09 09:39:21,213 INFO L226 Difference]: Without dead ends: 12391 [2025-01-09 09:39:21,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-01-09 09:39:21,231 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 4463 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 2916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4463 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 4498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2916 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:21,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4463 Valid, 1839 Invalid, 4498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2916 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 09:39:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12391 states. [2025-01-09 09:39:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12391 to 1657. [2025-01-09 09:39:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1160 states have (on average 1.418103448275862) internal successors, (1645), 1166 states have internal predecessors, (1645), 432 states have call successors, (432), 64 states have call predecessors, (432), 64 states have return successors, (432), 426 states have call predecessors, (432), 432 states have call successors, (432) [2025-01-09 09:39:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2509 transitions. [2025-01-09 09:39:21,853 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2509 transitions. Word has length 460 [2025-01-09 09:39:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:21,853 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2509 transitions. [2025-01-09 09:39:21,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-01-09 09:39:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2509 transitions. [2025-01-09 09:39:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-09 09:39:21,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:21,857 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:39:21,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:39:21,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -964238984, now seen corresponding path program 1 times [2025-01-09 09:39:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642159784] [2025-01-09 09:39:21,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:21,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 09:39:21,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 09:39:21,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:21,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-01-09 09:39:23,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:23,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642159784] [2025-01-09 09:39:23,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642159784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:23,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:23,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:39:23,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232835947] [2025-01-09 09:39:23,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:23,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:39:23,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:23,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:39:23,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:39:23,744 INFO L87 Difference]: Start difference. First operand 1657 states and 2509 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-01-09 09:39:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:29,095 INFO L93 Difference]: Finished difference Result 6100 states and 8866 transitions. [2025-01-09 09:39:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 09:39:29,096 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) Word has length 460 [2025-01-09 09:39:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:29,109 INFO L225 Difference]: With dead ends: 6100 [2025-01-09 09:39:29,109 INFO L226 Difference]: Without dead ends: 4773 [2025-01-09 09:39:29,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2025-01-09 09:39:29,115 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 1986 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 1309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 2550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1309 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:29,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 1707 Invalid, 2550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1309 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 09:39:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2025-01-09 09:39:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 2576. [2025-01-09 09:39:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2576 states, 1783 states have (on average 1.3712843522153673) internal successors, (2445), 1795 states have internal predecessors, (2445), 664 states have call successors, (664), 128 states have call predecessors, (664), 128 states have return successors, (664), 652 states have call predecessors, (664), 664 states have call successors, (664) [2025-01-09 09:39:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3773 transitions. [2025-01-09 09:39:30,029 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3773 transitions. Word has length 460 [2025-01-09 09:39:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:30,030 INFO L471 AbstractCegarLoop]: Abstraction has 2576 states and 3773 transitions. [2025-01-09 09:39:30,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 3 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 3 states have call predecessors, (72), 3 states have call successors, (72) [2025-01-09 09:39:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3773 transitions. [2025-01-09 09:39:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-09 09:39:30,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:30,033 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:39:30,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:39:30,033 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash 370374200, now seen corresponding path program 1 times [2025-01-09 09:39:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218352191] [2025-01-09 09:39:30,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:30,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 09:39:30,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 09:39:30,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:30,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 117 proven. 96 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-01-09 09:39:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218352191] [2025-01-09 09:39:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218352191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:39:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118989890] [2025-01-09 09:39:31,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:31,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:39:31,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:31,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:39:31,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 09:39:31,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-09 09:39:31,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-09 09:39:31,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:31,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:31,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 09:39:31,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:39:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 6282 proven. 249 refuted. 0 times theorem prover too weak. 3693 trivial. 0 not checked. [2025-01-09 09:39:37,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:39:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 372 proven. 258 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-01-09 09:39:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118989890] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:39:42,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:39:42,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2025-01-09 09:39:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731193119] [2025-01-09 09:39:42,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:39:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 09:39:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:42,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 09:39:42,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 09:39:42,046 INFO L87 Difference]: Start difference. First operand 2576 states and 3773 transitions. Second operand has 36 states, 36 states have (on average 6.25) internal successors, (225), 35 states have internal predecessors, (225), 10 states have call successors, (142), 4 states have call predecessors, (142), 10 states have return successors, (143), 11 states have call predecessors, (143), 10 states have call successors, (143) [2025-01-09 09:39:50,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:39:53,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 09:40:00,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]