./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.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 c89190f71494cfa64250ca9ffdf4d785818c50a201306d43ec124de4003d1620 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:21:42,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:21:42,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:21:42,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:21:42,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:21:42,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:21:42,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:21:42,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:21:42,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:21:42,797 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:21:42,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:21:42,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:21:42,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:21:42,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:21:42,798 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:21:42,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:21:42,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:21:42,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:21:42,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:21:42,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:21:42,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:21:42,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:21:42,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:21:42,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:21:42,800 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:21:42,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:21:42,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:21:42,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:21:42,800 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:21:42,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:42,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:42,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:42,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:42,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:21:42,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:42,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:42,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:42,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:42,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:21:42,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:21:42,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:21:42,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:21:42,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:21:42,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:21:42,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:21:42,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:21:42,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:21:42,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:21:42,802 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 -> c89190f71494cfa64250ca9ffdf4d785818c50a201306d43ec124de4003d1620 [2025-01-09 14:21:43,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:21:43,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:21:43,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:21:43,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:21:43,107 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:21:43,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.i [2025-01-09 14:21:44,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f1ddc91e/a908dcc1a6d04fa984fb29631e27b217/FLAGf7754a147 [2025-01-09 14:21:44,764 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:21:44,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.i [2025-01-09 14:21:44,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f1ddc91e/a908dcc1a6d04fa984fb29631e27b217/FLAGf7754a147 [2025-01-09 14:21:44,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2f1ddc91e/a908dcc1a6d04fa984fb29631e27b217 [2025-01-09 14:21:44,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:21:44,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:21:44,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:44,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:21:44,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:21:44,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:44" (1/1) ... [2025-01-09 14:21:44,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a34d04b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:44, skipping insertion in model container [2025-01-09 14:21:44,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:44" (1/1) ... [2025-01-09 14:21:44,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:21:44,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.i[916,929] [2025-01-09 14:21:45,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:45,149 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:21:45,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-26.i[916,929] [2025-01-09 14:21:45,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:45,272 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:21:45,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45 WrapperNode [2025-01-09 14:21:45,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:45,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:45,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:21:45,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:21:45,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,367 INFO L138 Inliner]: procedures = 26, calls = 72, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 523 [2025-01-09 14:21:45,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:45,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:21:45,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:21:45,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:21:45,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,436 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:21:45,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:21:45,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:21:45,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:21:45,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:21:45,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (1/1) ... [2025-01-09 14:21:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:45,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:45,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:21:45,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:21:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:21:45,582 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:21:45,583 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:21:45,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:21:45,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:21:45,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:21:45,701 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:21:45,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:21:46,749 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-01-09 14:21:46,749 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:21:46,766 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:21:46,768 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:21:46,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:46 BoogieIcfgContainer [2025-01-09 14:21:46,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:21:46,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:21:46,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:21:46,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:21:46,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:21:44" (1/3) ... [2025-01-09 14:21:46,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72615e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:46, skipping insertion in model container [2025-01-09 14:21:46,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:45" (2/3) ... [2025-01-09 14:21:46,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72615e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:46, skipping insertion in model container [2025-01-09 14:21:46,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:46" (3/3) ... [2025-01-09 14:21:46,779 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-26.i [2025-01-09 14:21:46,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:21:46,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-26.i that has 2 procedures, 220 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:21:46,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:21:46,863 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;@4216c0e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:21:46,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:21:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 158 states have (on average 1.481012658227848) internal successors, (234), 159 states have internal predecessors, (234), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:21:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 14:21:46,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:46,891 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:46,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:46,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1289803757, now seen corresponding path program 1 times [2025-01-09 14:21:46,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633386959] [2025-01-09 14:21:46,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:47,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 14:21:47,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 14:21:47,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:47,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2025-01-09 14:21:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633386959] [2025-01-09 14:21:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633386959] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:21:47,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122034656] [2025-01-09 14:21:47,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:47,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:47,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:47,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:21:47,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:21:47,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 14:21:47,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 14:21:47,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:47,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:47,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:21:47,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2025-01-09 14:21:47,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:21:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122034656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:47,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:21:47,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:21:47,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513170318] [2025-01-09 14:21:47,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:47,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:21:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:47,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:21:47,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:21:47,890 INFO L87 Difference]: Start difference. First operand has 220 states, 158 states have (on average 1.481012658227848) internal successors, (234), 159 states have internal predecessors, (234), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) 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, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 14:21:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:47,937 INFO L93 Difference]: Finished difference Result 434 states and 758 transitions. [2025-01-09 14:21:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:21:47,939 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, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) Word has length 392 [2025-01-09 14:21:47,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:47,946 INFO L225 Difference]: With dead ends: 434 [2025-01-09 14:21:47,946 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 14:21:47,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:21:47,954 INFO L435 NwaCegarLoop]: 347 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, 347 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:47,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 14:21:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-01-09 14:21:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 156 states have (on average 1.4679487179487178) internal successors, (229), 156 states have internal predecessors, (229), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:21:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2025-01-09 14:21:48,019 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 392 [2025-01-09 14:21:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:48,020 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2025-01-09 14:21:48,020 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, (59), 2 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 14:21:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2025-01-09 14:21:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 14:21:48,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:48,032 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:48,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:21:48,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:21:48,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:48,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash 117719101, now seen corresponding path program 1 times [2025-01-09 14:21:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690098897] [2025-01-09 14:21:48,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:48,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 14:21:48,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 14:21:48,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:48,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:21:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690098897] [2025-01-09 14:21:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690098897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:48,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:48,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:48,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679695143] [2025-01-09 14:21:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:48,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:48,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:48,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:48,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:48,699 INFO L87 Difference]: Start difference. First operand 217 states and 347 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:48,833 INFO L93 Difference]: Finished difference Result 645 states and 1035 transitions. [2025-01-09 14:21:48,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:48,834 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 392 [2025-01-09 14:21:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:48,841 INFO L225 Difference]: With dead ends: 645 [2025-01-09 14:21:48,842 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 14:21:48,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:48,843 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 322 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:48,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 866 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:21:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 14:21:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2025-01-09 14:21:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 308 states have (on average 1.4610389610389611) internal successors, (450), 308 states have internal predecessors, (450), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:21:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 686 transitions. [2025-01-09 14:21:48,928 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 686 transitions. Word has length 392 [2025-01-09 14:21:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:48,932 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 686 transitions. [2025-01-09 14:21:48,932 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 686 transitions. [2025-01-09 14:21:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 14:21:48,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:48,940 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:48,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:21:48,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:48,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:48,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1805508933, now seen corresponding path program 1 times [2025-01-09 14:21:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255663414] [2025-01-09 14:21:48,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:48,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 14:21:49,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 14:21:49,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:49,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:21:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255663414] [2025-01-09 14:21:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255663414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:49,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:49,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:49,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461564777] [2025-01-09 14:21:49,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:49,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:49,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:49,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:49,375 INFO L87 Difference]: Start difference. First operand 429 states and 686 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:49,506 INFO L93 Difference]: Finished difference Result 1271 states and 2032 transitions. [2025-01-09 14:21:49,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:49,506 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 392 [2025-01-09 14:21:49,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:49,520 INFO L225 Difference]: With dead ends: 1271 [2025-01-09 14:21:49,520 INFO L226 Difference]: Without dead ends: 845 [2025-01-09 14:21:49,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:49,524 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 308 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:49,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 674 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-01-09 14:21:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 515. [2025-01-09 14:21:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 394 states have (on average 1.50253807106599) internal successors, (592), 394 states have internal predecessors, (592), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:21:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 828 transitions. [2025-01-09 14:21:49,627 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 828 transitions. Word has length 392 [2025-01-09 14:21:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 828 transitions. [2025-01-09 14:21:49,631 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 828 transitions. [2025-01-09 14:21:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 14:21:49,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:49,639 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:49,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:21:49,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:49,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash 301815899, now seen corresponding path program 1 times [2025-01-09 14:21:49,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:49,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342525510] [2025-01-09 14:21:49,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:49,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 14:21:49,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 14:21:49,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:49,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:21:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342525510] [2025-01-09 14:21:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342525510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:50,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:50,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981505737] [2025-01-09 14:21:50,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:50,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:50,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:50,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:50,155 INFO L87 Difference]: Start difference. First operand 515 states and 828 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:50,289 INFO L93 Difference]: Finished difference Result 1237 states and 1990 transitions. [2025-01-09 14:21:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:50,290 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 392 [2025-01-09 14:21:50,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:50,299 INFO L225 Difference]: With dead ends: 1237 [2025-01-09 14:21:50,299 INFO L226 Difference]: Without dead ends: 725 [2025-01-09 14:21:50,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:50,304 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 125 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:50,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 653 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:21:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-01-09 14:21:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 653. [2025-01-09 14:21:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 532 states have (on average 1.5451127819548873) internal successors, (822), 532 states have internal predecessors, (822), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:21:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1058 transitions. [2025-01-09 14:21:50,403 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1058 transitions. Word has length 392 [2025-01-09 14:21:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:50,405 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1058 transitions. [2025-01-09 14:21:50,406 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, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1058 transitions. [2025-01-09 14:21:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 14:21:50,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:50,414 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:50,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:21:50,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:50,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:50,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1338921473, now seen corresponding path program 1 times [2025-01-09 14:21:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:50,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118392099] [2025-01-09 14:21:50,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:50,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:50,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 14:21:50,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 14:21:50,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:50,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:21:50,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118392099] [2025-01-09 14:21:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118392099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:50,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:50,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086299690] [2025-01-09 14:21:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:50,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:50,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:50,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:50,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:50,829 INFO L87 Difference]: Start difference. First operand 653 states and 1058 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:50,886 INFO L93 Difference]: Finished difference Result 1307 states and 2121 transitions. [2025-01-09 14:21:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:50,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 393 [2025-01-09 14:21:50,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:50,893 INFO L225 Difference]: With dead ends: 1307 [2025-01-09 14:21:50,893 INFO L226 Difference]: Without dead ends: 657 [2025-01-09 14:21:50,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:50,898 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:50,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 686 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-01-09 14:21:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2025-01-09 14:21:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 536 states have (on average 1.541044776119403) internal successors, (826), 536 states have internal predecessors, (826), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 118 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:21:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1062 transitions. [2025-01-09 14:21:50,954 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1062 transitions. Word has length 393 [2025-01-09 14:21:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:50,956 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1062 transitions. [2025-01-09 14:21:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1062 transitions. [2025-01-09 14:21:50,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 14:21:50,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:50,961 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:50,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:21:50,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:50,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash -59057795, now seen corresponding path program 1 times [2025-01-09 14:21:50,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:50,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602084158] [2025-01-09 14:21:50,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:51,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 14:21:51,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 14:21:51,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:51,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:21:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602084158] [2025-01-09 14:21:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602084158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:51,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:51,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480403953] [2025-01-09 14:21:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:51,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:51,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:51,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:51,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:51,511 INFO L87 Difference]: Start difference. First operand 657 states and 1062 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:51,608 INFO L93 Difference]: Finished difference Result 1639 states and 2657 transitions. [2025-01-09 14:21:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 393 [2025-01-09 14:21:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:51,616 INFO L225 Difference]: With dead ends: 1639 [2025-01-09 14:21:51,616 INFO L226 Difference]: Without dead ends: 985 [2025-01-09 14:21:51,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:51,619 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 232 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:51,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 670 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-01-09 14:21:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 983. [2025-01-09 14:21:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 802 states have (on average 1.5423940149625934) internal successors, (1237), 802 states have internal predecessors, (1237), 177 states have call successors, (177), 3 states have call predecessors, (177), 3 states have return successors, (177), 177 states have call predecessors, (177), 177 states have call successors, (177) [2025-01-09 14:21:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1591 transitions. [2025-01-09 14:21:51,690 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1591 transitions. Word has length 393 [2025-01-09 14:21:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:51,691 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1591 transitions. [2025-01-09 14:21:51,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1591 transitions. [2025-01-09 14:21:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 14:21:51,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:51,697 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:21:51,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1537310719, now seen corresponding path program 1 times [2025-01-09 14:21:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050676612] [2025-01-09 14:21:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:51,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 14:21:51,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 14:21:51,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:51,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:21:53,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:53,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050676612] [2025-01-09 14:21:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050676612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:53,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:53,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:21:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736908890] [2025-01-09 14:21:53,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:53,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:21:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:53,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:21:53,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:21:53,248 INFO L87 Difference]: Start difference. First operand 983 states and 1591 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:54,374 INFO L93 Difference]: Finished difference Result 3551 states and 5741 transitions. [2025-01-09 14:21:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:21:54,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 393 [2025-01-09 14:21:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:54,391 INFO L225 Difference]: With dead ends: 3551 [2025-01-09 14:21:54,392 INFO L226 Difference]: Without dead ends: 2571 [2025-01-09 14:21:54,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:21:54,397 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 726 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:54,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1783 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:21:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2025-01-09 14:21:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2081. [2025-01-09 14:21:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 1766 states have (on average 1.5560588901472254) internal successors, (2748), 1768 states have internal predecessors, (2748), 307 states have call successors, (307), 7 states have call predecessors, (307), 7 states have return successors, (307), 305 states have call predecessors, (307), 307 states have call successors, (307) [2025-01-09 14:21:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3362 transitions. [2025-01-09 14:21:54,581 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3362 transitions. Word has length 393 [2025-01-09 14:21:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:54,582 INFO L471 AbstractCegarLoop]: Abstraction has 2081 states and 3362 transitions. [2025-01-09 14:21:54,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:21:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3362 transitions. [2025-01-09 14:21:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 14:21:54,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:54,587 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:54,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:21:54,588 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:54,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1093410045, now seen corresponding path program 1 times [2025-01-09 14:21:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:54,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868282175] [2025-01-09 14:21:54,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:54,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:54,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 14:21:54,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 14:21:54,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:54,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:21:55,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:55,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868282175] [2025-01-09 14:21:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868282175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:56,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 14:21:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658921852] [2025-01-09 14:21:56,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 14:21:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:56,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 14:21:56,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 14:21:56,002 INFO L87 Difference]: Start difference. First operand 2081 states and 3362 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 14:21:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:58,805 INFO L93 Difference]: Finished difference Result 11217 states and 18067 transitions. [2025-01-09 14:21:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 14:21:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 393 [2025-01-09 14:21:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:58,846 INFO L225 Difference]: With dead ends: 11217 [2025-01-09 14:21:58,847 INFO L226 Difference]: Without dead ends: 9139 [2025-01-09 14:21:58,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2025-01-09 14:21:58,857 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 2856 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2856 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:58,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2856 Valid, 2791 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 14:21:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2025-01-09 14:21:59,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 4372. [2025-01-09 14:21:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 3996 states have (on average 1.5975975975975976) internal successors, (6384), 3998 states have internal predecessors, (6384), 366 states have call successors, (366), 9 states have call predecessors, (366), 9 states have return successors, (366), 364 states have call predecessors, (366), 366 states have call successors, (366) [2025-01-09 14:21:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 7116 transitions. [2025-01-09 14:21:59,189 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 7116 transitions. Word has length 393 [2025-01-09 14:21:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:59,191 INFO L471 AbstractCegarLoop]: Abstraction has 4372 states and 7116 transitions. [2025-01-09 14:21:59,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 14:21:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 7116 transitions. [2025-01-09 14:21:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 14:21:59,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:59,203 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:21:59,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:21:59,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:59,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash -391810171, now seen corresponding path program 1 times [2025-01-09 14:21:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021260244] [2025-01-09 14:21:59,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:59,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:59,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 14:21:59,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 14:21:59,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:59,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:22:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021260244] [2025-01-09 14:22:00,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021260244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:00,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:00,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:22:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543791666] [2025-01-09 14:22:00,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:00,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:22:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:00,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:22:00,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:22:00,181 INFO L87 Difference]: Start difference. First operand 4372 states and 7116 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:00,785 INFO L93 Difference]: Finished difference Result 8466 states and 13688 transitions. [2025-01-09 14:22:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:22:00,786 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), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 393 [2025-01-09 14:22:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:00,822 INFO L225 Difference]: With dead ends: 8466 [2025-01-09 14:22:00,822 INFO L226 Difference]: Without dead ends: 7043 [2025-01-09 14:22:00,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:22:00,829 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 636 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:00,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1208 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:22:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7043 states. [2025-01-09 14:22:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7043 to 6787. [2025-01-09 14:22:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6787 states, 6219 states have (on average 1.5894838398456343) internal successors, (9885), 6226 states have internal predecessors, (9885), 551 states have call successors, (551), 16 states have call predecessors, (551), 16 states have return successors, (551), 544 states have call predecessors, (551), 551 states have call successors, (551) [2025-01-09 14:22:01,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6787 states to 6787 states and 10987 transitions. [2025-01-09 14:22:01,131 INFO L78 Accepts]: Start accepts. Automaton has 6787 states and 10987 transitions. Word has length 393 [2025-01-09 14:22:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:01,132 INFO L471 AbstractCegarLoop]: Abstraction has 6787 states and 10987 transitions. [2025-01-09 14:22:01,132 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), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6787 states and 10987 transitions. [2025-01-09 14:22:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 14:22:01,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:01,151 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:01,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:22:01,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:01,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash -960794973, now seen corresponding path program 1 times [2025-01-09 14:22:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800597739] [2025-01-09 14:22:01,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:01,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:01,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 14:22:01,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 14:22:01,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:01,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:22:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800597739] [2025-01-09 14:22:01,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800597739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:01,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:01,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:22:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060648638] [2025-01-09 14:22:01,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:01,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:22:01,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:01,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:22:01,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:22:01,300 INFO L87 Difference]: Start difference. First operand 6787 states and 10987 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:01,552 INFO L93 Difference]: Finished difference Result 10818 states and 17428 transitions. [2025-01-09 14:22:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:22:01,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 393 [2025-01-09 14:22:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:01,596 INFO L225 Difference]: With dead ends: 10818 [2025-01-09 14:22:01,597 INFO L226 Difference]: Without dead ends: 7993 [2025-01-09 14:22:01,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:22:01,605 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 307 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:01,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1003 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:22:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7993 states. [2025-01-09 14:22:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7993 to 6787. [2025-01-09 14:22:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6787 states, 6219 states have (on average 1.5740472744814278) internal successors, (9789), 6226 states have internal predecessors, (9789), 551 states have call successors, (551), 16 states have call predecessors, (551), 16 states have return successors, (551), 544 states have call predecessors, (551), 551 states have call successors, (551) [2025-01-09 14:22:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6787 states to 6787 states and 10891 transitions. [2025-01-09 14:22:01,922 INFO L78 Accepts]: Start accepts. Automaton has 6787 states and 10891 transitions. Word has length 393 [2025-01-09 14:22:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:01,924 INFO L471 AbstractCegarLoop]: Abstraction has 6787 states and 10891 transitions. [2025-01-09 14:22:01,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6787 states and 10891 transitions. [2025-01-09 14:22:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 14:22:01,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:01,944 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:01,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:22:01,945 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:01,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1525999239, now seen corresponding path program 1 times [2025-01-09 14:22:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:01,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640492863] [2025-01-09 14:22:01,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:01,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 14:22:02,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 14:22:02,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:02,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:22:02,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:02,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640492863] [2025-01-09 14:22:02,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640492863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:02,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:02,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:22:02,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383374021] [2025-01-09 14:22:02,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:02,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:22:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:02,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:22:02,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:22:02,284 INFO L87 Difference]: Start difference. First operand 6787 states and 10891 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:02,573 INFO L93 Difference]: Finished difference Result 11919 states and 19108 transitions. [2025-01-09 14:22:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:22:02,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 394 [2025-01-09 14:22:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:02,603 INFO L225 Difference]: With dead ends: 11919 [2025-01-09 14:22:02,603 INFO L226 Difference]: Without dead ends: 7700 [2025-01-09 14:22:02,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:22:02,618 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 204 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:02,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 981 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:22:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7700 states. [2025-01-09 14:22:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7700 to 7482. [2025-01-09 14:22:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7482 states, 6816 states have (on average 1.5702758215962442) internal successors, (10703), 6824 states have internal predecessors, (10703), 647 states have call successors, (647), 18 states have call predecessors, (647), 18 states have return successors, (647), 639 states have call predecessors, (647), 647 states have call successors, (647) [2025-01-09 14:22:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7482 states to 7482 states and 11997 transitions. [2025-01-09 14:22:02,887 INFO L78 Accepts]: Start accepts. Automaton has 7482 states and 11997 transitions. Word has length 394 [2025-01-09 14:22:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 7482 states and 11997 transitions. [2025-01-09 14:22:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7482 states and 11997 transitions. [2025-01-09 14:22:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 14:22:02,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:02,901 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:02,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:22:02,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash -246135561, now seen corresponding path program 1 times [2025-01-09 14:22:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744306453] [2025-01-09 14:22:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:02,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 14:22:03,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 14:22:03,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:03,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 14:22:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744306453] [2025-01-09 14:22:03,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744306453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:03,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255196521] [2025-01-09 14:22:03,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:03,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:03,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:22:03,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:22:03,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 14:22:04,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 14:22:04,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:04,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:04,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:22:04,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3390 proven. 72 refuted. 0 times theorem prover too weak. 3382 trivial. 0 not checked. [2025-01-09 14:22:05,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 102 proven. 72 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 14:22:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255196521] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:22:05,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:22:05,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-01-09 14:22:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005630247] [2025-01-09 14:22:05,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:05,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:22:05,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:05,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:22:05,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:22:05,863 INFO L87 Difference]: Start difference. First operand 7482 states and 11997 transitions. Second operand has 16 states, 16 states have (on average 14.375) internal successors, (230), 16 states have internal predecessors, (230), 5 states have call successors, (176), 3 states have call predecessors, (176), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) [2025-01-09 14:22:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:10,027 INFO L93 Difference]: Finished difference Result 21755 states and 34558 transitions. [2025-01-09 14:22:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-09 14:22:10,028 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 14.375) internal successors, (230), 16 states have internal predecessors, (230), 5 states have call successors, (176), 3 states have call predecessors, (176), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) Word has length 394 [2025-01-09 14:22:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:10,076 INFO L225 Difference]: With dead ends: 21755 [2025-01-09 14:22:10,076 INFO L226 Difference]: Without dead ends: 14604 [2025-01-09 14:22:10,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1065, Invalid=4191, Unknown=0, NotChecked=0, Total=5256 [2025-01-09 14:22:10,092 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 3494 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 1492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3497 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1492 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:10,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3497 Valid, 2739 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1492 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 14:22:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14604 states. [2025-01-09 14:22:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14604 to 10707. [2025-01-09 14:22:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10707 states, 9170 states have (on average 1.511668484187568) internal successors, (13862), 9197 states have internal predecessors, (13862), 1445 states have call successors, (1445), 91 states have call predecessors, (1445), 91 states have return successors, (1445), 1418 states have call predecessors, (1445), 1445 states have call successors, (1445) [2025-01-09 14:22:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10707 states to 10707 states and 16752 transitions. [2025-01-09 14:22:10,942 INFO L78 Accepts]: Start accepts. Automaton has 10707 states and 16752 transitions. Word has length 394 [2025-01-09 14:22:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:10,943 INFO L471 AbstractCegarLoop]: Abstraction has 10707 states and 16752 transitions. [2025-01-09 14:22:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.375) internal successors, (230), 16 states have internal predecessors, (230), 5 states have call successors, (176), 3 states have call predecessors, (176), 6 states have return successors, (177), 5 states have call predecessors, (177), 5 states have call successors, (177) [2025-01-09 14:22:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 10707 states and 16752 transitions. [2025-01-09 14:22:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 14:22:10,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:10,952 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:10,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:22:11,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:11,153 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:11,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:11,154 INFO L85 PathProgramCache]: Analyzing trace with hash 830875195, now seen corresponding path program 1 times [2025-01-09 14:22:11,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:11,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990936298] [2025-01-09 14:22:11,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:11,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 14:22:11,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 14:22:11,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:11,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:22:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990936298] [2025-01-09 14:22:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990936298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:11,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:11,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:22:11,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702255827] [2025-01-09 14:22:11,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:11,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:22:11,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:11,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:22:11,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:22:11,559 INFO L87 Difference]: Start difference. First operand 10707 states and 16752 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:12,034 INFO L93 Difference]: Finished difference Result 27331 states and 42792 transitions. [2025-01-09 14:22:12,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:22:12,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 394 [2025-01-09 14:22:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:12,093 INFO L225 Difference]: With dead ends: 27331 [2025-01-09 14:22:12,093 INFO L226 Difference]: Without dead ends: 17792 [2025-01-09 14:22:12,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:22:12,122 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 138 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:12,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1137 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:22:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17792 states. [2025-01-09 14:22:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17792 to 11823. [2025-01-09 14:22:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11823 states, 10286 states have (on average 1.5117635621232743) internal successors, (15550), 10313 states have internal predecessors, (15550), 1445 states have call successors, (1445), 91 states have call predecessors, (1445), 91 states have return successors, (1445), 1418 states have call predecessors, (1445), 1445 states have call successors, (1445) [2025-01-09 14:22:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11823 states to 11823 states and 18440 transitions. [2025-01-09 14:22:12,736 INFO L78 Accepts]: Start accepts. Automaton has 11823 states and 18440 transitions. Word has length 394 [2025-01-09 14:22:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:12,737 INFO L471 AbstractCegarLoop]: Abstraction has 11823 states and 18440 transitions. [2025-01-09 14:22:12,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 11823 states and 18440 transitions. [2025-01-09 14:22:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-01-09 14:22:12,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:12,748 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:12,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:22:12,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:12,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1218512647, now seen corresponding path program 1 times [2025-01-09 14:22:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:12,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866293663] [2025-01-09 14:22:12,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:12,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 14:22:13,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 14:22:13,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:13,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 14:22:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866293663] [2025-01-09 14:22:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866293663] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553509138] [2025-01-09 14:22:13,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:13,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:13,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:13,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:22:13,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:22:13,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-01-09 14:22:13,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-01-09 14:22:13,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:13,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:13,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:22:13,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 1840 proven. 147 refuted. 0 times theorem prover too weak. 4857 trivial. 0 not checked. [2025-01-09 14:22:15,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 27 proven. 147 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 14:22:15,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553509138] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:22:15,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:22:15,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2025-01-09 14:22:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428963778] [2025-01-09 14:22:15,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:15,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:22:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:15,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:22:15,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:22:15,605 INFO L87 Difference]: Start difference. First operand 11823 states and 18440 transitions. Second operand has 17 states, 17 states have (on average 12.882352941176471) internal successors, (219), 17 states have internal predecessors, (219), 6 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 5 states have call predecessors, (177), 6 states have call successors, (177) [2025-01-09 14:22:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:20,248 INFO L93 Difference]: Finished difference Result 76117 states and 118066 transitions. [2025-01-09 14:22:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-01-09 14:22:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.882352941176471) internal successors, (219), 17 states have internal predecessors, (219), 6 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 5 states have call predecessors, (177), 6 states have call successors, (177) Word has length 394 [2025-01-09 14:22:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:20,463 INFO L225 Difference]: With dead ends: 76117 [2025-01-09 14:22:20,463 INFO L226 Difference]: Without dead ends: 64418 [2025-01-09 14:22:20,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=982, Invalid=3848, Unknown=0, NotChecked=0, Total=4830 [2025-01-09 14:22:20,502 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 3902 mSDsluCounter, 3617 mSDsCounter, 0 mSdLazyCounter, 2800 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3960 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:20,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3960 Valid, 3966 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2800 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 14:22:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64418 states. [2025-01-09 14:22:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64418 to 51276. [2025-01-09 14:22:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51276 states, 44645 states have (on average 1.4924627617874342) internal successors, (66631), 44812 states have internal predecessors, (66631), 6149 states have call successors, (6149), 481 states have call predecessors, (6149), 481 states have return successors, (6149), 5982 states have call predecessors, (6149), 6149 states have call successors, (6149) [2025-01-09 14:22:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51276 states to 51276 states and 78929 transitions. [2025-01-09 14:22:23,430 INFO L78 Accepts]: Start accepts. Automaton has 51276 states and 78929 transitions. Word has length 394 [2025-01-09 14:22:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 51276 states and 78929 transitions. [2025-01-09 14:22:23,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.882352941176471) internal successors, (219), 17 states have internal predecessors, (219), 6 states have call successors, (177), 3 states have call predecessors, (177), 6 states have return successors, (177), 5 states have call predecessors, (177), 6 states have call successors, (177) [2025-01-09 14:22:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 51276 states and 78929 transitions. [2025-01-09 14:22:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-01-09 14:22:23,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:23,441 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:23,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:22:23,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:23,645 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:23,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:23,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1501670294, now seen corresponding path program 1 times [2025-01-09 14:22:23,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:23,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384614725] [2025-01-09 14:22:23,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:23,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:23,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-01-09 14:22:23,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-01-09 14:22:23,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:23,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:22:24,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:24,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384614725] [2025-01-09 14:22:24,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384614725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:24,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:24,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:22:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325691677] [2025-01-09 14:22:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:24,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:22:24,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:24,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:22:24,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:22:24,034 INFO L87 Difference]: Start difference. First operand 51276 states and 78929 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:25,748 INFO L93 Difference]: Finished difference Result 112991 states and 174346 transitions. [2025-01-09 14:22:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:22:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 397 [2025-01-09 14:22:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:25,994 INFO L225 Difference]: With dead ends: 112991 [2025-01-09 14:22:25,994 INFO L226 Difference]: Without dead ends: 86258 [2025-01-09 14:22:26,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:22:26,050 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 367 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:26,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1791 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:22:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86258 states. [2025-01-09 14:22:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86258 to 56580. [2025-01-09 14:22:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56580 states, 49949 states have (on average 1.502572624076558) internal successors, (75052), 50116 states have internal predecessors, (75052), 6149 states have call successors, (6149), 481 states have call predecessors, (6149), 481 states have return successors, (6149), 5982 states have call predecessors, (6149), 6149 states have call successors, (6149) [2025-01-09 14:22:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56580 states to 56580 states and 87350 transitions. [2025-01-09 14:22:29,094 INFO L78 Accepts]: Start accepts. Automaton has 56580 states and 87350 transitions. Word has length 397 [2025-01-09 14:22:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:29,094 INFO L471 AbstractCegarLoop]: Abstraction has 56580 states and 87350 transitions. [2025-01-09 14:22:29,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 56580 states and 87350 transitions. [2025-01-09 14:22:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-01-09 14:22:29,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:29,105 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:29,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:22:29,105 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:29,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1460995544, now seen corresponding path program 1 times [2025-01-09 14:22:29,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:29,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846917210] [2025-01-09 14:22:29,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:29,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:29,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-01-09 14:22:29,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-01-09 14:22:29,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:29,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:22:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:29,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846917210] [2025-01-09 14:22:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846917210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:29,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:29,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:22:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605399223] [2025-01-09 14:22:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:22:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:29,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:22:29,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:22:29,561 INFO L87 Difference]: Start difference. First operand 56580 states and 87350 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:31,119 INFO L93 Difference]: Finished difference Result 110885 states and 171113 transitions. [2025-01-09 14:22:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 14:22:31,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 397 [2025-01-09 14:22:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:31,304 INFO L225 Difference]: With dead ends: 110885 [2025-01-09 14:22:31,304 INFO L226 Difference]: Without dead ends: 54428 [2025-01-09 14:22:31,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:22:31,411 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 282 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:31,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1409 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:22:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54428 states. [2025-01-09 14:22:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54428 to 53976. [2025-01-09 14:22:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53976 states, 47345 states have (on average 1.5003273840954694) internal successors, (71033), 47512 states have internal predecessors, (71033), 6149 states have call successors, (6149), 481 states have call predecessors, (6149), 481 states have return successors, (6149), 5982 states have call predecessors, (6149), 6149 states have call successors, (6149) [2025-01-09 14:22:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53976 states to 53976 states and 83331 transitions. [2025-01-09 14:22:34,068 INFO L78 Accepts]: Start accepts. Automaton has 53976 states and 83331 transitions. Word has length 397 [2025-01-09 14:22:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:34,069 INFO L471 AbstractCegarLoop]: Abstraction has 53976 states and 83331 transitions. [2025-01-09 14:22:34,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-01-09 14:22:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 53976 states and 83331 transitions. [2025-01-09 14:22:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-01-09 14:22:34,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:34,076 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:34,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 14:22:34,077 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:34,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash -722698853, now seen corresponding path program 1 times [2025-01-09 14:22:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696749664] [2025-01-09 14:22:34,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:34,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-01-09 14:22:34,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-01-09 14:22:34,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:34,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 33 proven. 141 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 14:22:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696749664] [2025-01-09 14:22:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696749664] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860727391] [2025-01-09 14:22:34,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:34,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:34,941 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:22:34,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:22:35,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-01-09 14:22:35,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-01-09 14:22:35,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:35,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:35,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:22:35,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3408 proven. 99 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2025-01-09 14:22:35,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 75 proven. 99 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-01-09 14:22:36,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860727391] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:22:36,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:22:36,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-01-09 14:22:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382655306] [2025-01-09 14:22:36,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:36,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:22:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:36,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:22:36,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:22:36,068 INFO L87 Difference]: Start difference. First operand 53976 states and 83331 transitions. Second operand has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 5 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 5 states have call predecessors, (152), 5 states have call successors, (152) [2025-01-09 14:22:38,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:38,752 INFO L93 Difference]: Finished difference Result 108797 states and 167257 transitions. [2025-01-09 14:22:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 14:22:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 5 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 5 states have call predecessors, (152), 5 states have call successors, (152) Word has length 397 [2025-01-09 14:22:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:38,931 INFO L225 Difference]: With dead ends: 108797 [2025-01-09 14:22:38,932 INFO L226 Difference]: Without dead ends: 54946 [2025-01-09 14:22:39,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 791 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:22:39,029 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1110 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:39,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1281 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:22:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54946 states. [2025-01-09 14:22:41,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54946 to 54492. [2025-01-09 14:22:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54492 states, 47667 states have (on average 1.4435563387668617) internal successors, (68810), 47834 states have internal predecessors, (68810), 6149 states have call successors, (6149), 675 states have call predecessors, (6149), 675 states have return successors, (6149), 5982 states have call predecessors, (6149), 6149 states have call successors, (6149) [2025-01-09 14:22:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54492 states to 54492 states and 81108 transitions. [2025-01-09 14:22:42,002 INFO L78 Accepts]: Start accepts. Automaton has 54492 states and 81108 transitions. Word has length 397 [2025-01-09 14:22:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:42,003 INFO L471 AbstractCegarLoop]: Abstraction has 54492 states and 81108 transitions. [2025-01-09 14:22:42,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 5 states have call successors, (151), 2 states have call predecessors, (151), 4 states have return successors, (152), 5 states have call predecessors, (152), 5 states have call successors, (152) [2025-01-09 14:22:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 54492 states and 81108 transitions. [2025-01-09 14:22:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-01-09 14:22:42,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:42,008 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:42,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:22:42,209 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,SelfDestructingSolverStorable16 [2025-01-09 14:22:42,209 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:42,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash 246037047, now seen corresponding path program 1 times [2025-01-09 14:22:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301356958] [2025-01-09 14:22:42,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:42,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-01-09 14:22:42,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-01-09 14:22:42,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:42,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:22:43,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301356958] [2025-01-09 14:22:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301356958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:43,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:43,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 14:22:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530838786] [2025-01-09 14:22:43,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:43,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:22:43,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:43,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:22:43,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:22:43,807 INFO L87 Difference]: Start difference. First operand 54492 states and 81108 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 14:22:46,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:46,593 INFO L93 Difference]: Finished difference Result 111801 states and 166183 transitions. [2025-01-09 14:22:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 14:22:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 398 [2025-01-09 14:22:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:46,727 INFO L225 Difference]: With dead ends: 111801 [2025-01-09 14:22:46,727 INFO L226 Difference]: Without dead ends: 58002 [2025-01-09 14:22:46,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:22:46,790 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 1014 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:46,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 2327 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:22:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58002 states. [2025-01-09 14:22:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58002 to 56562. [2025-01-09 14:22:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56562 states, 49735 states have (on average 1.443088368352267) internal successors, (71772), 49902 states have internal predecessors, (71772), 6149 states have call successors, (6149), 677 states have call predecessors, (6149), 677 states have return successors, (6149), 5982 states have call predecessors, (6149), 6149 states have call successors, (6149) [2025-01-09 14:22:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56562 states to 56562 states and 84070 transitions. [2025-01-09 14:22:48,898 INFO L78 Accepts]: Start accepts. Automaton has 56562 states and 84070 transitions. Word has length 398 [2025-01-09 14:22:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:48,899 INFO L471 AbstractCegarLoop]: Abstraction has 56562 states and 84070 transitions. [2025-01-09 14:22:48,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2025-01-09 14:22:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 56562 states and 84070 transitions. [2025-01-09 14:22:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-01-09 14:22:48,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:48,907 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:22:48,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 14:22:48,907 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:48,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -644722335, now seen corresponding path program 1 times [2025-01-09 14:22:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334719999] [2025-01-09 14:22:48,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:48,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-01-09 14:22:48,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-01-09 14:22:48,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:48,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-01-09 14:22:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334719999] [2025-01-09 14:22:49,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334719999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:22:49,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:22:49,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:22:49,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818703351] [2025-01-09 14:22:49,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:22:49,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:22:49,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:49,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:22:49,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:22:49,933 INFO L87 Difference]: Start difference. First operand 56562 states and 84070 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59)