./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 b28318b64c584c946b04c5086a6c24adb23afe0fc28f8c52df4df9b28156611e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:11:49,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:11:49,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:11:49,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:11:49,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:11:49,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:11:49,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:11:49,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:11:49,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:11:49,270 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:11:49,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:11:49,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:11:49,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:11:49,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:11:49,272 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:11:49,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:11:49,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:11:49,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:11:49,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:11:49,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:11:49,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:11:49,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:11:49,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:49,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:11:49,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:11:49,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:11:49,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:11:49,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:11:49,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:11:49,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:11:49,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:11:49,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:11:49,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:11:49,275 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/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 -> b28318b64c584c946b04c5086a6c24adb23afe0fc28f8c52df4df9b28156611e [2025-03-04 00:11:49,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:11:49,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:11:49,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:11:49,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:11:49,599 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:11:49,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i [2025-03-04 00:11:50,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369597e1e/a3da6ecaf06f45128298093b2f06c648/FLAGc15e6ab37 [2025-03-04 00:11:51,080 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:11:51,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i [2025-03-04 00:11:51,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369597e1e/a3da6ecaf06f45128298093b2f06c648/FLAGc15e6ab37 [2025-03-04 00:11:51,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369597e1e/a3da6ecaf06f45128298093b2f06c648 [2025-03-04 00:11:51,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:11:51,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:11:51,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:51,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:11:51,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:11:51,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f4b53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51, skipping insertion in model container [2025-03-04 00:11:51,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:11:51,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i[916,929] [2025-03-04 00:11:51,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:51,644 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:11:51,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i[916,929] [2025-03-04 00:11:51,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:51,755 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:11:51,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51 WrapperNode [2025-03-04 00:11:51,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:51,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:51,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:11:51,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:11:51,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,840 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2025-03-04 00:11:51,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:51,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:11:51,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:11:51,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:11:51,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,891 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-03-04 00:11:51,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:11:51,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:11:51,944 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:11:51,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:11:51,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (1/1) ... [2025-03-04 00:11:51,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:51,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:11:51,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:11:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:11:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:11:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:11:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:11:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:11:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:11:52,070 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:11:52,072 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:11:52,585 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L368: havoc property_#t~bitwise39#1;havoc property_#t~short40#1;havoc property_#t~short41#1;havoc property_#t~bitwise42#1;havoc property_#t~short43#1; [2025-03-04 00:11:52,639 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-04 00:11:52,639 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:11:52,654 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:11:52,654 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:11:52,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:52 BoogieIcfgContainer [2025-03-04 00:11:52,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:11:52,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:11:52,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:11:52,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:11:52,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:11:51" (1/3) ... [2025-03-04 00:11:52,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7b93a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:52, skipping insertion in model container [2025-03-04 00:11:52,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:51" (2/3) ... [2025-03-04 00:11:52,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7b93a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:52, skipping insertion in model container [2025-03-04 00:11:52,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:52" (3/3) ... [2025-03-04 00:11:52,663 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-46.i [2025-03-04 00:11:52,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:11:52,676 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-46.i that has 2 procedures, 174 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:11:52,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:11:52,732 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;@3855da1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:11:52,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:11:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 116 states have internal predecessors, (163), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 00:11:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-04 00:11:52,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:52,752 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:52,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2003634177, now seen corresponding path program 1 times [2025-03-04 00:11:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500957748] [2025-03-04 00:11:52,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:52,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:11:53,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:11:53,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:53,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:11:53,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:53,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500957748] [2025-03-04 00:11:53,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500957748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:53,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:53,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:11:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430890338] [2025-03-04 00:11:53,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:53,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:11:53,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:53,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:11:53,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:11:53,502 INFO L87 Difference]: Start difference. First operand has 174 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 116 states have internal predecessors, (163), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:11:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:53,575 INFO L93 Difference]: Finished difference Result 343 states and 603 transitions. [2025-03-04 00:11:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:11:53,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-03-04 00:11:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:53,587 INFO L225 Difference]: With dead ends: 343 [2025-03-04 00:11:53,588 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 00:11:53,591 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-03-04 00:11:53,595 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:53,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 00:11:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-04 00:11:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 00:11:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 271 transitions. [2025-03-04 00:11:53,655 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 271 transitions. Word has length 365 [2025-03-04 00:11:53,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:53,657 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 271 transitions. [2025-03-04 00:11:53,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:11:53,657 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 271 transitions. [2025-03-04 00:11:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-04 00:11:53,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:53,667 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:53,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 00:11:53,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:53,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1748897632, now seen corresponding path program 1 times [2025-03-04 00:11:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:53,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312958492] [2025-03-04 00:11:53,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:53,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:53,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:11:53,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:11:53,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:53,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:11:55,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:55,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312958492] [2025-03-04 00:11:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312958492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:11:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:11:55,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845641753] [2025-03-04 00:11:55,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:55,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:11:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:55,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:11:55,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:11:55,508 INFO L87 Difference]: Start difference. First operand 172 states and 271 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:11:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:55,709 INFO L93 Difference]: Finished difference Result 479 states and 754 transitions. [2025-03-04 00:11:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:11:55,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-03-04 00:11:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:55,715 INFO L225 Difference]: With dead ends: 479 [2025-03-04 00:11:55,715 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 00:11:55,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:11:55,719 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 217 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:55,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 930 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:11:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 00:11:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 192. [2025-03-04 00:11:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 134 states have internal predecessors, (191), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 00:11:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 303 transitions. [2025-03-04 00:11:55,746 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 303 transitions. Word has length 365 [2025-03-04 00:11:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:55,748 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 303 transitions. [2025-03-04 00:11:55,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:11:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 303 transitions. [2025-03-04 00:11:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-04 00:11:55,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:55,752 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:11:55,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:11:55,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 724203711, now seen corresponding path program 1 times [2025-03-04 00:11:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:55,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113072817] [2025-03-04 00:11:55,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:55,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:11:57,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:11:57,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:57,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:11:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113072817] [2025-03-04 00:11:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113072817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915483484] [2025-03-04 00:11:57,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:57,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:57,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:57,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:11:57,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:11:58,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:11:58,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:11:58,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:58,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:58,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:11:58,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3079 proven. 186 refuted. 0 times theorem prover too weak. 2895 trivial. 0 not checked. [2025-03-04 00:11:59,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 138 proven. 189 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-04 00:12:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915483484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:00,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 25 [2025-03-04 00:12:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192707334] [2025-03-04 00:12:00,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:00,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 00:12:00,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:00,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 00:12:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:12:00,294 INFO L87 Difference]: Start difference. First operand 192 states and 303 transitions. Second operand has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 states have internal predecessors, (223), 8 states have call successors, (168), 4 states have call predecessors, (168), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) [2025-03-04 00:12:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:06,049 INFO L93 Difference]: Finished difference Result 1545 states and 2323 transitions. [2025-03-04 00:12:06,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-04 00:12:06,049 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 states have internal predecessors, (223), 8 states have call successors, (168), 4 states have call predecessors, (168), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) Word has length 365 [2025-03-04 00:12:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:06,058 INFO L225 Difference]: With dead ends: 1545 [2025-03-04 00:12:06,058 INFO L226 Difference]: Without dead ends: 1356 [2025-03-04 00:12:06,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6216 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2727, Invalid=13023, Unknown=0, NotChecked=0, Total=15750 [2025-03-04 00:12:06,065 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 3244 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 3568 mSolverCounterSat, 1717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3262 SdHoareTripleChecker+Valid, 3340 SdHoareTripleChecker+Invalid, 5285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1717 IncrementalHoareTripleChecker+Valid, 3568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:06,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3262 Valid, 3340 Invalid, 5285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1717 Valid, 3568 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 00:12:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-03-04 00:12:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 857. [2025-03-04 00:12:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 606 states have (on average 1.3613861386138615) internal successors, (825), 610 states have internal predecessors, (825), 230 states have call successors, (230), 20 states have call predecessors, (230), 20 states have return successors, (230), 226 states have call predecessors, (230), 230 states have call successors, (230) [2025-03-04 00:12:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1285 transitions. [2025-03-04 00:12:06,160 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1285 transitions. Word has length 365 [2025-03-04 00:12:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:06,161 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1285 transitions. [2025-03-04 00:12:06,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.92) internal successors, (223), 25 states have internal predecessors, (223), 8 states have call successors, (168), 4 states have call predecessors, (168), 8 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) [2025-03-04 00:12:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1285 transitions. [2025-03-04 00:12:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-04 00:12:06,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:06,164 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:06,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:06,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:06,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash -558140384, now seen corresponding path program 1 times [2025-03-04 00:12:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524745560] [2025-03-04 00:12:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:06,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:12:06,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:12:06,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:06,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-03-04 00:12:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524745560] [2025-03-04 00:12:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524745560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:07,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:07,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:12:07,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045150168] [2025-03-04 00:12:07,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:07,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:12:07,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:07,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:12:07,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:12:07,156 INFO L87 Difference]: Start difference. First operand 857 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:12:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:07,623 INFO L93 Difference]: Finished difference Result 2620 states and 3891 transitions. [2025-03-04 00:12:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:12:07,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-03-04 00:12:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:07,637 INFO L225 Difference]: With dead ends: 2620 [2025-03-04 00:12:07,637 INFO L226 Difference]: Without dead ends: 1948 [2025-03-04 00:12:07,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-04 00:12:07,641 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 405 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:07,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1035 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-03-04 00:12:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1419. [2025-03-04 00:12:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1028 states have (on average 1.3618677042801557) internal successors, (1400), 1037 states have internal predecessors, (1400), 354 states have call successors, (354), 36 states have call predecessors, (354), 36 states have return successors, (354), 345 states have call predecessors, (354), 354 states have call successors, (354) [2025-03-04 00:12:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2108 transitions. [2025-03-04 00:12:07,768 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2108 transitions. Word has length 365 [2025-03-04 00:12:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:07,769 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 2108 transitions. [2025-03-04 00:12:07,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-03-04 00:12:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2108 transitions. [2025-03-04 00:12:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-04 00:12:07,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:07,772 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:07,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:12:07,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:07,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1582834305, now seen corresponding path program 1 times [2025-03-04 00:12:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:07,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339399424] [2025-03-04 00:12:07,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:07,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:07,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:12:08,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:12:08,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:08,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 30 proven. 135 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:12:09,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:09,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339399424] [2025-03-04 00:12:09,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339399424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:09,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105343791] [2025-03-04 00:12:09,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:09,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:09,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:12:09,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-04 00:12:09,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-04 00:12:09,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:09,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:09,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:12:09,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3404 proven. 210 refuted. 0 times theorem prover too weak. 2546 trivial. 0 not checked. [2025-03-04 00:12:09,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 114 proven. 213 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-04 00:12:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105343791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:10,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 00:12:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72380606] [2025-03-04 00:12:10,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:10,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:12:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:10,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:12:10,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:12:10,603 INFO L87 Difference]: Start difference. First operand 1419 states and 2108 transitions. Second operand has 18 states, 18 states have (on average 10.11111111111111) internal successors, (182), 18 states have internal predecessors, (182), 8 states have call successors, (151), 3 states have call predecessors, (151), 7 states have return successors, (152), 8 states have call predecessors, (152), 8 states have call successors, (152) [2025-03-04 00:12:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:11,964 INFO L93 Difference]: Finished difference Result 2635 states and 3837 transitions. [2025-03-04 00:12:11,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 00:12:11,965 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.11111111111111) internal successors, (182), 18 states have internal predecessors, (182), 8 states have call successors, (151), 3 states have call predecessors, (151), 7 states have return successors, (152), 8 states have call predecessors, (152), 8 states have call successors, (152) Word has length 365 [2025-03-04 00:12:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:11,971 INFO L225 Difference]: With dead ends: 2635 [2025-03-04 00:12:11,972 INFO L226 Difference]: Without dead ends: 1350 [2025-03-04 00:12:11,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 00:12:11,976 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1243 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:11,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 1344 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:12:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-03-04 00:12:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1155. [2025-03-04 00:12:12,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 808 states have (on average 1.316831683168317) internal successors, (1064), 814 states have internal predecessors, (1064), 302 states have call successors, (302), 44 states have call predecessors, (302), 44 states have return successors, (302), 296 states have call predecessors, (302), 302 states have call successors, (302) [2025-03-04 00:12:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1668 transitions. [2025-03-04 00:12:12,068 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1668 transitions. Word has length 365 [2025-03-04 00:12:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:12,068 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1668 transitions. [2025-03-04 00:12:12,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.11111111111111) internal successors, (182), 18 states have internal predecessors, (182), 8 states have call successors, (151), 3 states have call predecessors, (151), 7 states have return successors, (152), 8 states have call predecessors, (152), 8 states have call successors, (152) [2025-03-04 00:12:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1668 transitions. [2025-03-04 00:12:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-04 00:12:12,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:12,079 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:12,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:12,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:12,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:12,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1740462179, now seen corresponding path program 1 times [2025-03-04 00:12:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717669590] [2025-03-04 00:12:12,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:12,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:12:13,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:12:13,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:13,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 57 proven. 108 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:12:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717669590] [2025-03-04 00:12:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717669590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868530769] [2025-03-04 00:12:13,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:13,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:13,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:13,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:13,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:12:13,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:12:14,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:12:14,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:14,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:14,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:12:14,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3025 proven. 66 refuted. 0 times theorem prover too weak. 3069 trivial. 0 not checked. [2025-03-04 00:12:14,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 99 proven. 66 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:12:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868530769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:14,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:14,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:12:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217501729] [2025-03-04 00:12:14,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:14,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:12:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:14,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:12:14,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:12:14,561 INFO L87 Difference]: Start difference. First operand 1155 states and 1668 transitions. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) [2025-03-04 00:12:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:14,970 INFO L93 Difference]: Finished difference Result 1726 states and 2463 transitions. [2025-03-04 00:12:14,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:12:14,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) Word has length 366 [2025-03-04 00:12:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:14,975 INFO L225 Difference]: With dead ends: 1726 [2025-03-04 00:12:14,975 INFO L226 Difference]: Without dead ends: 719 [2025-03-04 00:12:14,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 730 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:12:14,978 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 345 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:14,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 444 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-04 00:12:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 705. [2025-03-04 00:12:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 498 states have (on average 1.283132530120482) internal successors, (639), 500 states have internal predecessors, (639), 169 states have call successors, (169), 37 states have call predecessors, (169), 37 states have return successors, (169), 167 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-04 00:12:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 977 transitions. [2025-03-04 00:12:15,029 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 977 transitions. Word has length 366 [2025-03-04 00:12:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:15,030 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 977 transitions. [2025-03-04 00:12:15,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 8 states have internal predecessors, (150), 3 states have call successors, (114), 2 states have call predecessors, (114), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) [2025-03-04 00:12:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 977 transitions. [2025-03-04 00:12:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-04 00:12:15,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:15,032 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:15,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:15,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:15,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:15,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1077122173, now seen corresponding path program 1 times [2025-03-04 00:12:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756926660] [2025-03-04 00:12:15,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:15,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:12:16,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:12:16,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:16,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 261 proven. 363 refuted. 0 times theorem prover too weak. 5536 trivial. 0 not checked. [2025-03-04 00:12:20,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756926660] [2025-03-04 00:12:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756926660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641205651] [2025-03-04 00:12:20,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:20,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:20,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:20,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:20,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:12:20,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:12:21,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:12:21,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:21,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:21,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 00:12:21,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4481 proven. 300 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2025-03-04 00:12:22,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 150 proven. 177 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-03-04 00:12:25,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641205651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:25,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 11] total 37 [2025-03-04 00:12:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915424048] [2025-03-04 00:12:25,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:25,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 00:12:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:25,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 00:12:25,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 00:12:25,812 INFO L87 Difference]: Start difference. First operand 705 states and 977 transitions. Second operand has 37 states, 36 states have (on average 6.972222222222222) internal successors, (251), 36 states have internal predecessors, (251), 15 states have call successors, (157), 5 states have call predecessors, (157), 9 states have return successors, (158), 14 states have call predecessors, (158), 15 states have call successors, (158) [2025-03-04 00:12:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:33,321 INFO L93 Difference]: Finished difference Result 2547 states and 3464 transitions. [2025-03-04 00:12:33,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-04 00:12:33,321 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 6.972222222222222) internal successors, (251), 36 states have internal predecessors, (251), 15 states have call successors, (157), 5 states have call predecessors, (157), 9 states have return successors, (158), 14 states have call predecessors, (158), 15 states have call successors, (158) Word has length 366 [2025-03-04 00:12:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:33,334 INFO L225 Difference]: With dead ends: 2547 [2025-03-04 00:12:33,334 INFO L226 Difference]: Without dead ends: 2020 [2025-03-04 00:12:33,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 734 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4528 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2558, Invalid=12448, Unknown=0, NotChecked=0, Total=15006 [2025-03-04 00:12:33,344 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 5194 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 1251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5206 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 6137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1251 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:33,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5206 Valid, 3254 Invalid, 6137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1251 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-04 00:12:33,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2025-03-04 00:12:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1737. [2025-03-04 00:12:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1245 states have (on average 1.2666666666666666) internal successors, (1577), 1252 states have internal predecessors, (1577), 379 states have call successors, (379), 112 states have call predecessors, (379), 112 states have return successors, (379), 372 states have call predecessors, (379), 379 states have call successors, (379) [2025-03-04 00:12:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2335 transitions. [2025-03-04 00:12:33,582 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2335 transitions. Word has length 366 [2025-03-04 00:12:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:33,584 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2335 transitions. [2025-03-04 00:12:33,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 6.972222222222222) internal successors, (251), 36 states have internal predecessors, (251), 15 states have call successors, (157), 5 states have call predecessors, (157), 9 states have return successors, (158), 14 states have call predecessors, (158), 15 states have call successors, (158) [2025-03-04 00:12:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2335 transitions. [2025-03-04 00:12:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-04 00:12:33,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:33,596 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:33,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:33,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:33,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:33,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash -726322236, now seen corresponding path program 1 times [2025-03-04 00:12:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965478096] [2025-03-04 00:12:33,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:33,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:12:35,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:12:35,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:35,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 126 proven. 39 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:12:37,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965478096] [2025-03-04 00:12:37,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965478096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984442422] [2025-03-04 00:12:37,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:37,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:37,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:37,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:37,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:12:37,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:12:37,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:12:37,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:37,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:37,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:12:37,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2323 proven. 39 refuted. 0 times theorem prover too weak. 3798 trivial. 0 not checked. [2025-03-04 00:12:38,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 126 proven. 39 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:12:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984442422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:38,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 00:12:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272100032] [2025-03-04 00:12:38,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:38,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 00:12:38,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:38,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 00:12:38,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:12:38,509 INFO L87 Difference]: Start difference. First operand 1737 states and 2335 transitions. Second operand has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-04 00:12:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:40,566 INFO L93 Difference]: Finished difference Result 5202 states and 6978 transitions. [2025-03-04 00:12:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:12:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 366 [2025-03-04 00:12:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:40,583 INFO L225 Difference]: With dead ends: 5202 [2025-03-04 00:12:40,584 INFO L226 Difference]: Without dead ends: 3504 [2025-03-04 00:12:40,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 724 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:12:40,589 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 703 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2666 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:40,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2666 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:12:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2025-03-04 00:12:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3002. [2025-03-04 00:12:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2165 states have (on average 1.2572748267898384) internal successors, (2722), 2181 states have internal predecessors, (2722), 634 states have call successors, (634), 202 states have call predecessors, (634), 202 states have return successors, (634), 618 states have call predecessors, (634), 634 states have call successors, (634) [2025-03-04 00:12:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3990 transitions. [2025-03-04 00:12:40,947 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3990 transitions. Word has length 366 [2025-03-04 00:12:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:40,948 INFO L471 AbstractCegarLoop]: Abstraction has 3002 states and 3990 transitions. [2025-03-04 00:12:40,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.222222222222221) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-03-04 00:12:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3990 transitions. [2025-03-04 00:12:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-04 00:12:40,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:40,953 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:40,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:12:41,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:41,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:41,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1244617221, now seen corresponding path program 1 times [2025-03-04 00:12:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:41,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258623703] [2025-03-04 00:12:41,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:41,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:12:45,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:12:45,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:45,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 108 proven. 57 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:12:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258623703] [2025-03-04 00:12:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258623703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807810580] [2025-03-04 00:12:45,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:45,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:45,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:12:45,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 00:12:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 00:12:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:46,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:12:46,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2863 proven. 57 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2025-03-04 00:12:47,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 108 proven. 57 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-03-04 00:12:47,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807810580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:47,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:47,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-03-04 00:12:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723357812] [2025-03-04 00:12:47,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:47,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 00:12:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:47,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 00:12:47,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-03-04 00:12:47,722 INFO L87 Difference]: Start difference. First operand 3002 states and 3990 transitions. Second operand has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 6 states have call successors, (168), 3 states have call predecessors, (168), 6 states have return successors, (168), 6 states have call predecessors, (168), 6 states have call successors, (168) [2025-03-04 00:12:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:49,118 INFO L93 Difference]: Finished difference Result 6139 states and 8214 transitions. [2025-03-04 00:12:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 00:12:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 6 states have call successors, (168), 3 states have call predecessors, (168), 6 states have return successors, (168), 6 states have call predecessors, (168), 6 states have call successors, (168) Word has length 366 [2025-03-04 00:12:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:49,131 INFO L225 Difference]: With dead ends: 6139 [2025-03-04 00:12:49,132 INFO L226 Difference]: Without dead ends: 3339 [2025-03-04 00:12:49,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:12:49,137 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 757 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:49,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1383 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:12:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2025-03-04 00:12:49,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2974. [2025-03-04 00:12:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2136 states have (on average 1.2542134831460674) internal successors, (2679), 2152 states have internal predecessors, (2679), 634 states have call successors, (634), 203 states have call predecessors, (634), 203 states have return successors, (634), 618 states have call predecessors, (634), 634 states have call successors, (634) [2025-03-04 00:12:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 3947 transitions. [2025-03-04 00:12:49,482 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 3947 transitions. Word has length 366 [2025-03-04 00:12:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:49,483 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 3947 transitions. [2025-03-04 00:12:49,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 6 states have call successors, (168), 3 states have call predecessors, (168), 6 states have return successors, (168), 6 states have call predecessors, (168), 6 states have call successors, (168) [2025-03-04 00:12:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3947 transitions. [2025-03-04 00:12:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-04 00:12:49,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:49,484 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:12:49,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:49,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:49,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1808884340, now seen corresponding path program 1 times [2025-03-04 00:12:49,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694901816] [2025-03-04 00:12:49,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:49,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-04 00:12:51,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-04 00:12:51,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:51,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat