./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_loopvsstraightlinecode_100-1loop_file-20.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 d7483f4c602f1d80c3d31837b57d86164e65df5e6fa201344a2b0a8f22740044 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:02:26,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:02:26,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:02:26,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:02:26,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:02:26,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:02:26,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:02:26,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:02:26,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:02:26,135 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:02:26,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:02:26,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:02:26,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:02:26,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:02:26,136 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:02:26,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:02:26,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:02:26,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:02:26,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:02:26,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:02:26,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:02:26,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:02:26,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:02:26,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:02:26,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:02:26,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:02:26,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:02:26,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:02:26,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:02:26,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:02:26,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:02:26,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:02:26,139 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 -> d7483f4c602f1d80c3d31837b57d86164e65df5e6fa201344a2b0a8f22740044 [2025-03-17 03:02:26,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:02:26,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:02:26,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:02:26,371 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:02:26,371 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:02:26,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-03-17 03:02:27,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad91c9500/cc3ab0fb8644455091284e46bad2f37f/FLAGedf82c8fa [2025-03-17 03:02:27,756 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:02:27,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-03-17 03:02:27,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad91c9500/cc3ab0fb8644455091284e46bad2f37f/FLAGedf82c8fa [2025-03-17 03:02:28,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad91c9500/cc3ab0fb8644455091284e46bad2f37f [2025-03-17 03:02:28,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:02:28,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:02:28,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:02:28,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:02:28,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:02:28,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f20ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28, skipping insertion in model container [2025-03-17 03:02:28,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:02:28,198 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_loopvsstraightlinecode_100-1loop_file-20.i[916,929] [2025-03-17 03:02:28,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:02:28,267 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:02:28,274 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_loopvsstraightlinecode_100-1loop_file-20.i[916,929] [2025-03-17 03:02:28,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:02:28,312 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:02:28,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28 WrapperNode [2025-03-17 03:02:28,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:02:28,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:02:28,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:02:28,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:02:28,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,370 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2025-03-17 03:02:28,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:02:28,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:02:28,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:02:28,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:02:28,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,400 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-17 03:02:28,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:02:28,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:02:28,422 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:02:28,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:02:28,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (1/1) ... [2025-03-17 03:02:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:02:28,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:02:28,448 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-17 03:02:28,450 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-17 03:02:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:02:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:02:28,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:02:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:02:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:02:28,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:02:28,532 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:02:28,533 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:02:28,961 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L199: havoc property_#t~bitwise23#1;havoc property_#t~short24#1;havoc property_#t~ite27#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short28#1; [2025-03-17 03:02:29,006 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-17 03:02:29,007 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:02:29,021 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:02:29,021 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 03:02:29,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:29 BoogieIcfgContainer [2025-03-17 03:02:29,021 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:02:29,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:02:29,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:02:29,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:02:29,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:02:28" (1/3) ... [2025-03-17 03:02:29,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581578d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:29, skipping insertion in model container [2025-03-17 03:02:29,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:02:28" (2/3) ... [2025-03-17 03:02:29,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581578d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:02:29, skipping insertion in model container [2025-03-17 03:02:29,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:02:29" (3/3) ... [2025-03-17 03:02:29,027 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-20.i [2025-03-17 03:02:29,040 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:02:29,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-20.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:02:29,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:02:29,107 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;@e8ec9e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:02:29,108 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:02:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:02:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 03:02:29,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:29,123 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:29,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:29,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1324003311, now seen corresponding path program 1 times [2025-03-17 03:02:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:29,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592718462] [2025-03-17 03:02:29,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:29,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:02:29,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:02:29,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:29,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 03:02:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592718462] [2025-03-17 03:02:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592718462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:02:29,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358123292] [2025-03-17 03:02:29,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:29,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:02:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:02:29,470 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-17 03:02:29,472 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-17 03:02:29,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:02:29,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:02:29,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:29,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:29,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:02:29,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:02:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 03:02:29,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:02:29,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358123292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:29,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:02:29,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:02:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848548440] [2025-03-17 03:02:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:29,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:02:29,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:29,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:02:29,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:02:29,708 INFO L87 Difference]: Start difference. First operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:02:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:29,742 INFO L93 Difference]: Finished difference Result 221 states and 378 transitions. [2025-03-17 03:02:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:02:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 201 [2025-03-17 03:02:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:29,753 INFO L225 Difference]: With dead ends: 221 [2025-03-17 03:02:29,753 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 03:02:29,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:02:29,759 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:29,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:02:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 03:02:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 03:02:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 03:02:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 170 transitions. [2025-03-17 03:02:29,796 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 170 transitions. Word has length 201 [2025-03-17 03:02:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:29,796 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 170 transitions. [2025-03-17 03:02:29,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:02:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 170 transitions. [2025-03-17 03:02:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 03:02:29,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:29,800 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:29,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:02:30,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:02:30,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:30,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1643246222, now seen corresponding path program 1 times [2025-03-17 03:02:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597846084] [2025-03-17 03:02:30,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:30,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 03:02:30,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 03:02:30,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:30,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:30,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597846084] [2025-03-17 03:02:30,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597846084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:30,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:30,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:02:30,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086821044] [2025-03-17 03:02:30,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:30,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:02:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:30,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:02:30,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:02:30,477 INFO L87 Difference]: Start difference. First operand 109 states and 170 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:30,708 INFO L93 Difference]: Finished difference Result 359 states and 560 transitions. [2025-03-17 03:02:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:02:30,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-03-17 03:02:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:30,712 INFO L225 Difference]: With dead ends: 359 [2025-03-17 03:02:30,712 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 03:02:30,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:02:30,715 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 165 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:30,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 509 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:02:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 03:02:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 240. [2025-03-17 03:02:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 175 states have (on average 1.4114285714285715) internal successors, (247), 175 states have internal predecessors, (247), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 03:02:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 371 transitions. [2025-03-17 03:02:30,746 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 371 transitions. Word has length 201 [2025-03-17 03:02:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:30,747 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 371 transitions. [2025-03-17 03:02:30,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 371 transitions. [2025-03-17 03:02:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 03:02:30,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:30,752 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:30,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:02:30,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:30,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1347895977, now seen corresponding path program 1 times [2025-03-17 03:02:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418449783] [2025-03-17 03:02:30,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:30,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 03:02:30,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 03:02:30,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:30,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:31,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418449783] [2025-03-17 03:02:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418449783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:31,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:02:31,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451205130] [2025-03-17 03:02:31,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:31,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:02:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:31,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:02:31,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:02:31,186 INFO L87 Difference]: Start difference. First operand 240 states and 371 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:31,390 INFO L93 Difference]: Finished difference Result 701 states and 1082 transitions. [2025-03-17 03:02:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:02:31,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-17 03:02:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:31,394 INFO L225 Difference]: With dead ends: 701 [2025-03-17 03:02:31,394 INFO L226 Difference]: Without dead ends: 462 [2025-03-17 03:02:31,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:02:31,395 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 141 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:31,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 629 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:02:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-17 03:02:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 315. [2025-03-17 03:02:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 250 states have (on average 1.456) internal successors, (364), 250 states have internal predecessors, (364), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 03:02:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 488 transitions. [2025-03-17 03:02:31,437 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 488 transitions. Word has length 202 [2025-03-17 03:02:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:31,438 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 488 transitions. [2025-03-17 03:02:31,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 488 transitions. [2025-03-17 03:02:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:02:31,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:31,441 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:31,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:02:31,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:31,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash 697887700, now seen corresponding path program 1 times [2025-03-17 03:02:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86823892] [2025-03-17 03:02:31,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:31,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:02:31,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:02:31,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:31,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86823892] [2025-03-17 03:02:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86823892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:31,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:31,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 03:02:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860490616] [2025-03-17 03:02:31,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:31,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 03:02:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:31,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 03:02:31,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:02:31,912 INFO L87 Difference]: Start difference. First operand 315 states and 488 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:32,526 INFO L93 Difference]: Finished difference Result 920 states and 1408 transitions. [2025-03-17 03:02:32,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:02:32,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:02:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:32,531 INFO L225 Difference]: With dead ends: 920 [2025-03-17 03:02:32,531 INFO L226 Difference]: Without dead ends: 606 [2025-03-17 03:02:32,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:02:32,532 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 249 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:32,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 630 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:02:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-17 03:02:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 455. [2025-03-17 03:02:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 376 states have (on average 1.4414893617021276) internal successors, (542), 378 states have internal predecessors, (542), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:02:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 690 transitions. [2025-03-17 03:02:32,565 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 690 transitions. Word has length 203 [2025-03-17 03:02:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:32,565 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 690 transitions. [2025-03-17 03:02:32,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 690 transitions. [2025-03-17 03:02:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:02:32,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:32,568 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:32,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:02:32,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:32,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1942652181, now seen corresponding path program 1 times [2025-03-17 03:02:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:32,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030392115] [2025-03-17 03:02:32,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:32,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:02:32,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:02:32,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:32,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:34,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:34,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030392115] [2025-03-17 03:02:34,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030392115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:34,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:34,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:02:34,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248190291] [2025-03-17 03:02:34,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:34,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:02:34,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:34,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:02:34,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:02:34,898 INFO L87 Difference]: Start difference. First operand 455 states and 690 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:36,017 INFO L93 Difference]: Finished difference Result 1379 states and 2065 transitions. [2025-03-17 03:02:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:02:36,018 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:02:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:36,023 INFO L225 Difference]: With dead ends: 1379 [2025-03-17 03:02:36,023 INFO L226 Difference]: Without dead ends: 925 [2025-03-17 03:02:36,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:02:36,025 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 405 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:36,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 593 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:02:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-17 03:02:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 588. [2025-03-17 03:02:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 509 states have (on average 1.4734774066797642) internal successors, (750), 511 states have internal predecessors, (750), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:02:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 898 transitions. [2025-03-17 03:02:36,063 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 898 transitions. Word has length 203 [2025-03-17 03:02:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:36,064 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 898 transitions. [2025-03-17 03:02:36,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 898 transitions. [2025-03-17 03:02:36,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:02:36,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:36,066 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:36,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 03:02:36,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:36,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash 945579828, now seen corresponding path program 1 times [2025-03-17 03:02:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:36,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231729439] [2025-03-17 03:02:36,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:36,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:02:36,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:02:36,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:36,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231729439] [2025-03-17 03:02:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231729439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:36,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:36,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:02:36,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6030391] [2025-03-17 03:02:36,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:36,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:02:36,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:36,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:02:36,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:02:36,161 INFO L87 Difference]: Start difference. First operand 588 states and 898 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:36,243 INFO L93 Difference]: Finished difference Result 1412 states and 2157 transitions. [2025-03-17 03:02:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:02:36,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:02:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:36,248 INFO L225 Difference]: With dead ends: 1412 [2025-03-17 03:02:36,248 INFO L226 Difference]: Without dead ends: 825 [2025-03-17 03:02:36,249 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-17 03:02:36,250 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 145 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:36,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 432 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 03:02:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-17 03:02:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 680. [2025-03-17 03:02:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 601 states have (on average 1.464226289517471) internal successors, (880), 603 states have internal predecessors, (880), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:02:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1028 transitions. [2025-03-17 03:02:36,281 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1028 transitions. Word has length 203 [2025-03-17 03:02:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:36,283 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1028 transitions. [2025-03-17 03:02:36,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1028 transitions. [2025-03-17 03:02:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:02:36,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:36,285 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:36,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 03:02:36,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:36,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:36,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1033250882, now seen corresponding path program 1 times [2025-03-17 03:02:36,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:36,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069170239] [2025-03-17 03:02:36,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:36,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:36,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:02:36,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:02:36,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:36,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069170239] [2025-03-17 03:02:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069170239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:02:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56251556] [2025-03-17 03:02:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:38,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:02:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:38,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:02:38,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:02:38,235 INFO L87 Difference]: Start difference. First operand 680 states and 1028 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:39,751 INFO L93 Difference]: Finished difference Result 1698 states and 2536 transitions. [2025-03-17 03:02:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:02:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:02:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:39,756 INFO L225 Difference]: With dead ends: 1698 [2025-03-17 03:02:39,757 INFO L226 Difference]: Without dead ends: 1019 [2025-03-17 03:02:39,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-17 03:02:39,760 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 524 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:39,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 790 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:02:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-03-17 03:02:39,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 751. [2025-03-17 03:02:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 672 states have (on average 1.4732142857142858) internal successors, (990), 674 states have internal predecessors, (990), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:02:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1138 transitions. [2025-03-17 03:02:39,816 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1138 transitions. Word has length 203 [2025-03-17 03:02:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:39,816 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1138 transitions. [2025-03-17 03:02:39,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1138 transitions. [2025-03-17 03:02:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:02:39,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:39,820 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:39,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 03:02:39,820 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:39,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1754164605, now seen corresponding path program 1 times [2025-03-17 03:02:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:39,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480246389] [2025-03-17 03:02:39,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:39,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:02:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:02:39,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:40,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:40,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480246389] [2025-03-17 03:02:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480246389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:40,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:40,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:02:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573945203] [2025-03-17 03:02:40,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:40,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:02:40,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:40,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:02:40,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:02:40,639 INFO L87 Difference]: Start difference. First operand 751 states and 1138 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:41,441 INFO L93 Difference]: Finished difference Result 1856 states and 2793 transitions. [2025-03-17 03:02:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:02:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:02:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:41,446 INFO L225 Difference]: With dead ends: 1856 [2025-03-17 03:02:41,446 INFO L226 Difference]: Without dead ends: 1106 [2025-03-17 03:02:41,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:02:41,447 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 499 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:41,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 371 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:02:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-17 03:02:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 721. [2025-03-17 03:02:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 642 states have (on average 1.4672897196261683) internal successors, (942), 644 states have internal predecessors, (942), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:02:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1090 transitions. [2025-03-17 03:02:41,480 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1090 transitions. Word has length 203 [2025-03-17 03:02:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:41,480 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1090 transitions. [2025-03-17 03:02:41,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1090 transitions. [2025-03-17 03:02:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:02:41,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:41,484 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:41,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:02:41,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:41,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash 188779011, now seen corresponding path program 1 times [2025-03-17 03:02:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:41,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549099293] [2025-03-17 03:02:41,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:41,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:41,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:02:41,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:02:41,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:41,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549099293] [2025-03-17 03:02:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549099293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:43,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:02:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118574519] [2025-03-17 03:02:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:02:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:43,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:02:43,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:02:43,206 INFO L87 Difference]: Start difference. First operand 721 states and 1090 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:44,281 INFO L93 Difference]: Finished difference Result 1682 states and 2513 transitions. [2025-03-17 03:02:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:02:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:02:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:44,285 INFO L225 Difference]: With dead ends: 1682 [2025-03-17 03:02:44,285 INFO L226 Difference]: Without dead ends: 962 [2025-03-17 03:02:44,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:02:44,289 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 353 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:44,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 828 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:02:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-03-17 03:02:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 731. [2025-03-17 03:02:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 652 states have (on average 1.4677914110429449) internal successors, (957), 654 states have internal predecessors, (957), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:02:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1105 transitions. [2025-03-17 03:02:44,317 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1105 transitions. Word has length 203 [2025-03-17 03:02:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:44,317 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1105 transitions. [2025-03-17 03:02:44,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1105 transitions. [2025-03-17 03:02:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 03:02:44,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:44,329 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:44,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 03:02:44,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:44,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1696330820, now seen corresponding path program 1 times [2025-03-17 03:02:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758419424] [2025-03-17 03:02:44,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:44,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 03:02:44,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 03:02:44,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:44,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:45,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:45,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758419424] [2025-03-17 03:02:45,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758419424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:45,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:45,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:02:45,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178547877] [2025-03-17 03:02:45,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:45,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:02:45,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:45,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:02:45,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:02:45,131 INFO L87 Difference]: Start difference. First operand 731 states and 1105 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:45,813 INFO L93 Difference]: Finished difference Result 1583 states and 2371 transitions. [2025-03-17 03:02:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:02:45,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 03:02:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:45,817 INFO L225 Difference]: With dead ends: 1583 [2025-03-17 03:02:45,817 INFO L226 Difference]: Without dead ends: 853 [2025-03-17 03:02:45,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:02:45,819 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 291 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:45,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 582 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:02:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-03-17 03:02:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 704. [2025-03-17 03:02:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 625 states have (on average 1.4624) internal successors, (914), 627 states have internal predecessors, (914), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:02:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1062 transitions. [2025-03-17 03:02:45,845 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1062 transitions. Word has length 203 [2025-03-17 03:02:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:45,847 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1062 transitions. [2025-03-17 03:02:45,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1062 transitions. [2025-03-17 03:02:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-17 03:02:45,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:45,849 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:45,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 03:02:45,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:45,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash 851318233, now seen corresponding path program 1 times [2025-03-17 03:02:45,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:45,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095780267] [2025-03-17 03:02:45,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:45,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 03:02:45,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 03:02:45,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:45,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:45,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:45,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095780267] [2025-03-17 03:02:45,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095780267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:45,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:45,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:02:45,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68991885] [2025-03-17 03:02:45,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:45,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:02:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:45,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:02:45,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:02:45,995 INFO L87 Difference]: Start difference. First operand 704 states and 1062 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:46,258 INFO L93 Difference]: Finished difference Result 1677 states and 2537 transitions. [2025-03-17 03:02:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:02:46,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-17 03:02:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:46,264 INFO L225 Difference]: With dead ends: 1677 [2025-03-17 03:02:46,264 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 03:02:46,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:02:46,267 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 150 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:46,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 635 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:02:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 03:02:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 732. [2025-03-17 03:02:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 653 states have (on average 1.4594180704441042) internal successors, (953), 655 states have internal predecessors, (953), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 03:02:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1101 transitions. [2025-03-17 03:02:46,296 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1101 transitions. Word has length 204 [2025-03-17 03:02:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:46,297 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1101 transitions. [2025-03-17 03:02:46,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1101 transitions. [2025-03-17 03:02:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:02:46,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:46,299 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:46,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 03:02:46,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:46,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 844742652, now seen corresponding path program 1 times [2025-03-17 03:02:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:46,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565583796] [2025-03-17 03:02:46,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:46,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:46,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:02:46,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:02:46,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:46,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:47,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565583796] [2025-03-17 03:02:47,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565583796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:47,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:47,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 03:02:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306552331] [2025-03-17 03:02:47,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:47,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 03:02:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:47,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 03:02:47,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:02:47,431 INFO L87 Difference]: Start difference. First operand 732 states and 1101 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:48,968 INFO L93 Difference]: Finished difference Result 1876 states and 2817 transitions. [2025-03-17 03:02:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:02:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:02:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:48,974 INFO L225 Difference]: With dead ends: 1876 [2025-03-17 03:02:48,974 INFO L226 Difference]: Without dead ends: 1551 [2025-03-17 03:02:48,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:02:48,975 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 511 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:48,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1259 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 03:02:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-03-17 03:02:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1017. [2025-03-17 03:02:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 926 states have (on average 1.4773218142548596) internal successors, (1368), 930 states have internal predecessors, (1368), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 03:02:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1532 transitions. [2025-03-17 03:02:49,007 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1532 transitions. Word has length 205 [2025-03-17 03:02:49,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:49,007 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1532 transitions. [2025-03-17 03:02:49,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1532 transitions. [2025-03-17 03:02:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:02:49,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:49,009 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:49,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 03:02:49,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:49,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash 339184027, now seen corresponding path program 1 times [2025-03-17 03:02:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:49,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47826860] [2025-03-17 03:02:49,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:49,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:02:49,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:02:49,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:49,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:49,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47826860] [2025-03-17 03:02:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47826860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:49,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:02:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184891667] [2025-03-17 03:02:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:49,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:02:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:49,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:02:49,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:02:49,925 INFO L87 Difference]: Start difference. First operand 1017 states and 1532 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:50,240 INFO L93 Difference]: Finished difference Result 2196 states and 3304 transitions. [2025-03-17 03:02:50,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:02:50,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:02:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:50,246 INFO L225 Difference]: With dead ends: 2196 [2025-03-17 03:02:50,246 INFO L226 Difference]: Without dead ends: 1518 [2025-03-17 03:02:50,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:02:50,248 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 265 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:50,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 542 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:02:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2025-03-17 03:02:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1195. [2025-03-17 03:02:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1104 states have (on average 1.4393115942028984) internal successors, (1589), 1108 states have internal predecessors, (1589), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 03:02:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1753 transitions. [2025-03-17 03:02:50,284 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1753 transitions. Word has length 205 [2025-03-17 03:02:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:50,284 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1753 transitions. [2025-03-17 03:02:50,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1753 transitions. [2025-03-17 03:02:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:02:50,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:50,299 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:50,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 03:02:50,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash -542136777, now seen corresponding path program 1 times [2025-03-17 03:02:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537787461] [2025-03-17 03:02:50,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:50,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:02:50,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:02:50,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:50,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:51,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:51,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537787461] [2025-03-17 03:02:51,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537787461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:51,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:51,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:02:51,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622068028] [2025-03-17 03:02:51,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:51,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:02:51,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:51,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:02:51,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:02:51,681 INFO L87 Difference]: Start difference. First operand 1195 states and 1753 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:52,620 INFO L93 Difference]: Finished difference Result 2926 states and 4242 transitions. [2025-03-17 03:02:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:02:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:02:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:52,625 INFO L225 Difference]: With dead ends: 2926 [2025-03-17 03:02:52,626 INFO L226 Difference]: Without dead ends: 1732 [2025-03-17 03:02:52,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:02:52,628 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 348 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:52,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 756 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:02:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-17 03:02:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1198. [2025-03-17 03:02:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1107 states have (on average 1.4263775971093045) internal successors, (1579), 1111 states have internal predecessors, (1579), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 03:02:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1743 transitions. [2025-03-17 03:02:52,668 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1743 transitions. Word has length 205 [2025-03-17 03:02:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:52,669 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1743 transitions. [2025-03-17 03:02:52,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1743 transitions. [2025-03-17 03:02:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:02:52,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:52,672 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:52,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 03:02:52,672 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:52,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1047695402, now seen corresponding path program 1 times [2025-03-17 03:02:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626993328] [2025-03-17 03:02:52,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:52,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:02:52,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:02:52,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:52,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:54,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:54,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626993328] [2025-03-17 03:02:54,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626993328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:54,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:54,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:02:54,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795012684] [2025-03-17 03:02:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:54,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:02:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:02:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:02:54,892 INFO L87 Difference]: Start difference. First operand 1198 states and 1743 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:56,799 INFO L93 Difference]: Finished difference Result 3056 states and 4378 transitions. [2025-03-17 03:02:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 03:02:56,800 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:02:56,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:56,808 INFO L225 Difference]: With dead ends: 3056 [2025-03-17 03:02:56,808 INFO L226 Difference]: Without dead ends: 1859 [2025-03-17 03:02:56,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-17 03:02:56,812 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 447 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:56,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1401 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:02:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-03-17 03:02:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1273. [2025-03-17 03:02:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 1149 states have (on average 1.4168842471714533) internal successors, (1628), 1153 states have internal predecessors, (1628), 113 states have call successors, (113), 10 states have call predecessors, (113), 10 states have return successors, (113), 109 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-17 03:02:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1854 transitions. [2025-03-17 03:02:56,860 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1854 transitions. Word has length 205 [2025-03-17 03:02:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:56,860 INFO L471 AbstractCegarLoop]: Abstraction has 1273 states and 1854 transitions. [2025-03-17 03:02:56,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1854 transitions. [2025-03-17 03:02:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:02:56,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:56,862 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:56,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 03:02:56,862 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:56,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1558229579, now seen corresponding path program 1 times [2025-03-17 03:02:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449690112] [2025-03-17 03:02:56,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:56,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:02:56,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:02:56,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:56,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:02:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449690112] [2025-03-17 03:02:57,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449690112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:02:57,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:02:57,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:02:57,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924439729] [2025-03-17 03:02:57,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:02:57,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:02:57,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:57,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:02:57,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:02:57,202 INFO L87 Difference]: Start difference. First operand 1273 states and 1854 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:02:58,238 INFO L93 Difference]: Finished difference Result 2911 states and 4198 transitions. [2025-03-17 03:02:58,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:02:58,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-03-17 03:02:58,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:02:58,244 INFO L225 Difference]: With dead ends: 2911 [2025-03-17 03:02:58,245 INFO L226 Difference]: Without dead ends: 1714 [2025-03-17 03:02:58,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:02:58,247 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 305 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:02:58,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 967 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:02:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-03-17 03:02:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1577. [2025-03-17 03:02:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1412 states have (on average 1.405099150141643) internal successors, (1984), 1417 states have internal predecessors, (1984), 150 states have call successors, (150), 14 states have call predecessors, (150), 14 states have return successors, (150), 145 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-17 03:02:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2284 transitions. [2025-03-17 03:02:58,309 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2284 transitions. Word has length 205 [2025-03-17 03:02:58,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:02:58,309 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2284 transitions. [2025-03-17 03:02:58,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:02:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2284 transitions. [2025-03-17 03:02:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 03:02:58,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:02:58,311 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:02:58,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 03:02:58,311 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:02:58,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:02:58,312 INFO L85 PathProgramCache]: Analyzing trace with hash -289463456, now seen corresponding path program 1 times [2025-03-17 03:02:58,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:02:58,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711716215] [2025-03-17 03:02:58,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:02:58,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:02:58,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:02:58,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:58,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 03:02:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:02:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711716215] [2025-03-17 03:02:58,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711716215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:02:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918388541] [2025-03-17 03:02:58,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:02:58,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:02:58,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:02:58,531 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-17 03:02:58,532 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-17 03:02:58,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 03:02:58,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 03:02:58,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:02:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:02:58,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 03:02:58,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:02:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 482 proven. 150 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2025-03-17 03:02:59,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:02:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 03:02:59,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918388541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:02:59,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:02:59,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 23 [2025-03-17 03:02:59,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873570439] [2025-03-17 03:02:59,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:02:59,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 03:02:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:02:59,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 03:02:59,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-17 03:02:59,688 INFO L87 Difference]: Start difference. First operand 1577 states and 2284 transitions. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 22 states have internal predecessors, (129), 5 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) [2025-03-17 03:03:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:01,466 INFO L93 Difference]: Finished difference Result 2503 states and 3578 transitions. [2025-03-17 03:03:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-17 03:03:01,467 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 22 states have internal predecessors, (129), 5 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) Word has length 205 [2025-03-17 03:03:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:01,471 INFO L225 Difference]: With dead ends: 2503 [2025-03-17 03:03:01,472 INFO L226 Difference]: Without dead ends: 989 [2025-03-17 03:03:01,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1057, Invalid=4055, Unknown=0, NotChecked=0, Total=5112 [2025-03-17 03:03:01,475 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 793 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:01,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 928 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:03:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-03-17 03:03:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 688. [2025-03-17 03:03:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 573 states have (on average 1.368237347294939) internal successors, (784), 575 states have internal predecessors, (784), 97 states have call successors, (97), 17 states have call predecessors, (97), 17 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 03:03:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 978 transitions. [2025-03-17 03:03:01,537 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 978 transitions. Word has length 205 [2025-03-17 03:03:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:01,537 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 978 transitions. [2025-03-17 03:03:01,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 22 states have internal predecessors, (129), 5 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (85), 5 states have call predecessors, (85), 5 states have call successors, (85) [2025-03-17 03:03:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 978 transitions. [2025-03-17 03:03:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:01,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:01,538 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:01,545 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-17 03:03:01,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 03:03:01,739 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:01,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:01,739 INFO L85 PathProgramCache]: Analyzing trace with hash 281762111, now seen corresponding path program 1 times [2025-03-17 03:03:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:01,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925441541] [2025-03-17 03:03:01,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:01,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:01,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:01,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:01,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:01,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:03,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:03,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925441541] [2025-03-17 03:03:03,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925441541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:03,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:03:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489326680] [2025-03-17 03:03:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:03:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:03,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:03:03,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:03:03,730 INFO L87 Difference]: Start difference. First operand 688 states and 978 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:05,328 INFO L93 Difference]: Finished difference Result 1897 states and 2659 transitions. [2025-03-17 03:03:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:03:05,329 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:03:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:05,333 INFO L225 Difference]: With dead ends: 1897 [2025-03-17 03:03:05,334 INFO L226 Difference]: Without dead ends: 1278 [2025-03-17 03:03:05,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:03:05,335 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 312 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:05,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1533 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 03:03:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-17 03:03:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 743. [2025-03-17 03:03:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 628 states have (on average 1.3837579617834395) internal successors, (869), 630 states have internal predecessors, (869), 97 states have call successors, (97), 17 states have call predecessors, (97), 17 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 03:03:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1063 transitions. [2025-03-17 03:03:05,389 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1063 transitions. Word has length 207 [2025-03-17 03:03:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:05,391 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1063 transitions. [2025-03-17 03:03:05,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1063 transitions. [2025-03-17 03:03:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:05,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:05,392 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 03:03:05,392 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:05,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash -223796514, now seen corresponding path program 1 times [2025-03-17 03:03:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:05,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286700049] [2025-03-17 03:03:05,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:05,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:05,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:05,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:05,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:05,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:06,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:06,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286700049] [2025-03-17 03:03:06,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286700049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:06,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:06,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:03:06,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366134078] [2025-03-17 03:03:06,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:06,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:03:06,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:06,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:03:06,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:03:06,807 INFO L87 Difference]: Start difference. First operand 743 states and 1063 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:07,693 INFO L93 Difference]: Finished difference Result 1952 states and 2729 transitions. [2025-03-17 03:03:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:03:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:03:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:07,698 INFO L225 Difference]: With dead ends: 1952 [2025-03-17 03:03:07,698 INFO L226 Difference]: Without dead ends: 1278 [2025-03-17 03:03:07,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:03:07,700 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 310 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:07,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1615 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 03:03:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-17 03:03:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 741. [2025-03-17 03:03:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 626 states have (on average 1.3833865814696487) internal successors, (866), 628 states have internal predecessors, (866), 97 states have call successors, (97), 17 states have call predecessors, (97), 17 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 03:03:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1060 transitions. [2025-03-17 03:03:07,754 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1060 transitions. Word has length 207 [2025-03-17 03:03:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:07,754 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1060 transitions. [2025-03-17 03:03:07,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1060 transitions. [2025-03-17 03:03:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:07,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:07,755 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:07,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 03:03:07,755 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:07,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash -228772066, now seen corresponding path program 1 times [2025-03-17 03:03:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:07,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831933155] [2025-03-17 03:03:07,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:07,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:07,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:07,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:07,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:08,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:08,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831933155] [2025-03-17 03:03:08,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831933155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:08,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:08,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:03:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903523725] [2025-03-17 03:03:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:08,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:03:08,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:03:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:03:08,344 INFO L87 Difference]: Start difference. First operand 741 states and 1060 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 03:03:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:09,684 INFO L93 Difference]: Finished difference Result 1682 states and 2371 transitions. [2025-03-17 03:03:09,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:03:09,685 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 207 [2025-03-17 03:03:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:09,689 INFO L225 Difference]: With dead ends: 1682 [2025-03-17 03:03:09,689 INFO L226 Difference]: Without dead ends: 1010 [2025-03-17 03:03:09,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:03:09,690 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 544 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:09,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1275 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 03:03:09,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-17 03:03:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 891. [2025-03-17 03:03:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 739 states have (on average 1.3640054127198917) internal successors, (1008), 741 states have internal predecessors, (1008), 128 states have call successors, (128), 23 states have call predecessors, (128), 23 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 03:03:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1264 transitions. [2025-03-17 03:03:09,753 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1264 transitions. Word has length 207 [2025-03-17 03:03:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:09,753 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1264 transitions. [2025-03-17 03:03:09,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 03:03:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1264 transitions. [2025-03-17 03:03:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:09,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:09,754 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:09,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 03:03:09,754 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:09,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1337584895, now seen corresponding path program 1 times [2025-03-17 03:03:09,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:09,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35095092] [2025-03-17 03:03:09,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:09,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:09,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:09,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:09,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:09,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35095092] [2025-03-17 03:03:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35095092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:11,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:03:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036241605] [2025-03-17 03:03:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:11,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:03:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:11,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:03:11,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:03:11,835 INFO L87 Difference]: Start difference. First operand 891 states and 1264 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:12,974 INFO L93 Difference]: Finished difference Result 2437 states and 3424 transitions. [2025-03-17 03:03:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:03:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:03:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:12,982 INFO L225 Difference]: With dead ends: 2437 [2025-03-17 03:03:12,982 INFO L226 Difference]: Without dead ends: 1765 [2025-03-17 03:03:12,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:03:12,983 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 472 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:12,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 875 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:03:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-03-17 03:03:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 911. [2025-03-17 03:03:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 759 states have (on average 1.3675889328063242) internal successors, (1038), 761 states have internal predecessors, (1038), 128 states have call successors, (128), 23 states have call predecessors, (128), 23 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 03:03:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1294 transitions. [2025-03-17 03:03:13,045 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1294 transitions. Word has length 207 [2025-03-17 03:03:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:13,048 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1294 transitions. [2025-03-17 03:03:13,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1294 transitions. [2025-03-17 03:03:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:13,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:13,050 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:13,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 03:03:13,050 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:13,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 832026270, now seen corresponding path program 1 times [2025-03-17 03:03:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:13,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94842381] [2025-03-17 03:03:13,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:13,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:13,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:13,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:13,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:14,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94842381] [2025-03-17 03:03:14,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94842381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:14,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:14,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 03:03:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637874869] [2025-03-17 03:03:14,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:14,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:03:14,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:14,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:03:14,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:03:14,690 INFO L87 Difference]: Start difference. First operand 911 states and 1294 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:15,769 INFO L93 Difference]: Finished difference Result 2098 states and 2940 transitions. [2025-03-17 03:03:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:03:15,770 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:03:15,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:15,778 INFO L225 Difference]: With dead ends: 2098 [2025-03-17 03:03:15,779 INFO L226 Difference]: Without dead ends: 1409 [2025-03-17 03:03:15,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:03:15,782 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 440 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:15,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1108 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 03:03:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-03-17 03:03:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 903. [2025-03-17 03:03:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 751 states have (on average 1.3661784287616512) internal successors, (1026), 753 states have internal predecessors, (1026), 128 states have call successors, (128), 23 states have call predecessors, (128), 23 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 03:03:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1282 transitions. [2025-03-17 03:03:15,841 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1282 transitions. Word has length 207 [2025-03-17 03:03:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:15,841 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1282 transitions. [2025-03-17 03:03:15,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1282 transitions. [2025-03-17 03:03:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:15,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:15,843 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:15,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 03:03:15,843 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:15,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash 827050718, now seen corresponding path program 1 times [2025-03-17 03:03:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:15,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844752828] [2025-03-17 03:03:15,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:15,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:16,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:16,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:16,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:21,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:21,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844752828] [2025-03-17 03:03:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844752828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:21,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:21,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 03:03:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740182063] [2025-03-17 03:03:21,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:21,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 03:03:21,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:21,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 03:03:21,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:03:21,151 INFO L87 Difference]: Start difference. First operand 903 states and 1282 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:22,724 INFO L93 Difference]: Finished difference Result 2258 states and 3166 transitions. [2025-03-17 03:03:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 03:03:22,725 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:03:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:22,729 INFO L225 Difference]: With dead ends: 2258 [2025-03-17 03:03:22,729 INFO L226 Difference]: Without dead ends: 1424 [2025-03-17 03:03:22,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-17 03:03:22,731 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 372 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:22,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1340 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 03:03:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-03-17 03:03:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 913. [2025-03-17 03:03:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 761 states have (on average 1.3679369250985545) internal successors, (1041), 763 states have internal predecessors, (1041), 128 states have call successors, (128), 23 states have call predecessors, (128), 23 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 03:03:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1297 transitions. [2025-03-17 03:03:22,790 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1297 transitions. Word has length 207 [2025-03-17 03:03:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:22,790 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1297 transitions. [2025-03-17 03:03:22,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1297 transitions. [2025-03-17 03:03:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:22,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:22,791 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:22,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 03:03:22,791 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:22,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:22,791 INFO L85 PathProgramCache]: Analyzing trace with hash 321492093, now seen corresponding path program 1 times [2025-03-17 03:03:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:22,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961763399] [2025-03-17 03:03:22,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:22,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:22,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:22,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:22,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:23,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:23,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961763399] [2025-03-17 03:03:23,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961763399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:23,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:23,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 03:03:23,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717445886] [2025-03-17 03:03:23,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:23,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:03:23,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:23,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:03:23,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:03:23,002 INFO L87 Difference]: Start difference. First operand 913 states and 1297 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 03:03:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:23,386 INFO L93 Difference]: Finished difference Result 2103 states and 2972 transitions. [2025-03-17 03:03:23,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:03:23,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 207 [2025-03-17 03:03:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:23,390 INFO L225 Difference]: With dead ends: 2103 [2025-03-17 03:03:23,390 INFO L226 Difference]: Without dead ends: 1259 [2025-03-17 03:03:23,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:03:23,392 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 307 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:23,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 904 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:03:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-17 03:03:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1066. [2025-03-17 03:03:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 877 states have (on average 1.3511972633979477) internal successors, (1185), 879 states have internal predecessors, (1185), 159 states have call successors, (159), 29 states have call predecessors, (159), 29 states have return successors, (159), 157 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-17 03:03:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1503 transitions. [2025-03-17 03:03:23,468 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1503 transitions. Word has length 207 [2025-03-17 03:03:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:23,469 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1503 transitions. [2025-03-17 03:03:23,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 03:03:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1503 transitions. [2025-03-17 03:03:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:23,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:23,469 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:23,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 03:03:23,470 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:23,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:23,470 INFO L85 PathProgramCache]: Analyzing trace with hash 493113024, now seen corresponding path program 1 times [2025-03-17 03:03:23,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:23,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715449779] [2025-03-17 03:03:23,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:23,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:23,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:23,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:23,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:23,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:24,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:24,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715449779] [2025-03-17 03:03:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715449779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:24,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:24,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 03:03:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531636710] [2025-03-17 03:03:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:24,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 03:03:24,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:24,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 03:03:24,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:03:24,889 INFO L87 Difference]: Start difference. First operand 1066 states and 1503 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:26,004 INFO L93 Difference]: Finished difference Result 2467 states and 3447 transitions. [2025-03-17 03:03:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:03:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:03:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:26,010 INFO L225 Difference]: With dead ends: 2467 [2025-03-17 03:03:26,010 INFO L226 Difference]: Without dead ends: 1623 [2025-03-17 03:03:26,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:03:26,013 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 454 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:26,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1161 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:03:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-03-17 03:03:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1051. [2025-03-17 03:03:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 862 states have (on average 1.345707656612529) internal successors, (1160), 864 states have internal predecessors, (1160), 159 states have call successors, (159), 29 states have call predecessors, (159), 29 states have return successors, (159), 157 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-17 03:03:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1478 transitions. [2025-03-17 03:03:26,100 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1478 transitions. Word has length 207 [2025-03-17 03:03:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:26,100 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1478 transitions. [2025-03-17 03:03:26,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1478 transitions. [2025-03-17 03:03:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-17 03:03:26,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:26,101 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:26,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 03:03:26,102 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:26,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:26,102 INFO L85 PathProgramCache]: Analyzing trace with hash -12445601, now seen corresponding path program 1 times [2025-03-17 03:03:26,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:26,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064690643] [2025-03-17 03:03:26,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:26,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:26,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 03:03:26,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 03:03:26,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:26,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:27,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:27,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064690643] [2025-03-17 03:03:27,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064690643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:27,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:27,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 03:03:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995166013] [2025-03-17 03:03:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:27,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:03:27,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:27,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:03:27,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:03:27,675 INFO L87 Difference]: Start difference. First operand 1051 states and 1478 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:29,743 INFO L93 Difference]: Finished difference Result 2374 states and 3315 transitions. [2025-03-17 03:03:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 03:03:29,744 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-03-17 03:03:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:29,748 INFO L225 Difference]: With dead ends: 2374 [2025-03-17 03:03:29,748 INFO L226 Difference]: Without dead ends: 1696 [2025-03-17 03:03:29,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-03-17 03:03:29,751 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 426 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:29,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1799 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 03:03:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2025-03-17 03:03:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1041. [2025-03-17 03:03:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 852 states have (on average 1.3450704225352113) internal successors, (1146), 854 states have internal predecessors, (1146), 159 states have call successors, (159), 29 states have call predecessors, (159), 29 states have return successors, (159), 157 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-17 03:03:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1464 transitions. [2025-03-17 03:03:29,835 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1464 transitions. Word has length 207 [2025-03-17 03:03:29,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:29,835 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1464 transitions. [2025-03-17 03:03:29,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1464 transitions. [2025-03-17 03:03:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:03:29,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:29,836 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:29,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 03:03:29,836 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:29,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1941748800, now seen corresponding path program 1 times [2025-03-17 03:03:29,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:29,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398504] [2025-03-17 03:03:29,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:29,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:29,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:03:29,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:03:29,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:29,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:30,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398504] [2025-03-17 03:03:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:03:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354708807] [2025-03-17 03:03:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:30,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:03:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:30,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:03:30,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:03:30,019 INFO L87 Difference]: Start difference. First operand 1041 states and 1464 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:30,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:30,646 INFO L93 Difference]: Finished difference Result 2986 states and 4114 transitions. [2025-03-17 03:03:30,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:03:30,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-17 03:03:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:30,651 INFO L225 Difference]: With dead ends: 2986 [2025-03-17 03:03:30,651 INFO L226 Difference]: Without dead ends: 2014 [2025-03-17 03:03:30,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:03:30,653 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 468 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:30,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1327 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 03:03:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-03-17 03:03:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1266. [2025-03-17 03:03:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1063 states have (on average 1.3461900282220132) internal successors, (1431), 1066 states have internal predecessors, (1431), 169 states have call successors, (169), 33 states have call predecessors, (169), 33 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 03:03:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1769 transitions. [2025-03-17 03:03:30,747 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1769 transitions. Word has length 209 [2025-03-17 03:03:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1769 transitions. [2025-03-17 03:03:30,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1769 transitions. [2025-03-17 03:03:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:03:30,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:30,749 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:30,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 03:03:30,749 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:30,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash 556267137, now seen corresponding path program 1 times [2025-03-17 03:03:30,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:30,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395300760] [2025-03-17 03:03:30,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:30,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:03:30,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:03:30,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:32,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:32,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395300760] [2025-03-17 03:03:32,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395300760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:32,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:32,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:03:32,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472336291] [2025-03-17 03:03:32,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:32,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:03:32,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:32,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:03:32,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:03:32,305 INFO L87 Difference]: Start difference. First operand 1266 states and 1769 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:33,593 INFO L93 Difference]: Finished difference Result 3044 states and 4200 transitions. [2025-03-17 03:03:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:03:33,595 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-17 03:03:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:33,599 INFO L225 Difference]: With dead ends: 3044 [2025-03-17 03:03:33,599 INFO L226 Difference]: Without dead ends: 2004 [2025-03-17 03:03:33,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:03:33,601 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 239 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:33,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1599 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 03:03:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2025-03-17 03:03:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1274. [2025-03-17 03:03:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1071 states have (on average 1.3473389355742298) internal successors, (1443), 1074 states have internal predecessors, (1443), 169 states have call successors, (169), 33 states have call predecessors, (169), 33 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-17 03:03:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1781 transitions. [2025-03-17 03:03:33,694 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1781 transitions. Word has length 209 [2025-03-17 03:03:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:33,694 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1781 transitions. [2025-03-17 03:03:33,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1781 transitions. [2025-03-17 03:03:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:03:33,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:33,695 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:33,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 03:03:33,695 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:33,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 45732960, now seen corresponding path program 1 times [2025-03-17 03:03:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920993400] [2025-03-17 03:03:33,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:33,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:03:33,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:03:33,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:33,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920993400] [2025-03-17 03:03:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920993400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 03:03:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638817229] [2025-03-17 03:03:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:34,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:03:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:34,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:03:34,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:03:34,101 INFO L87 Difference]: Start difference. First operand 1274 states and 1781 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:34,842 INFO L93 Difference]: Finished difference Result 3567 states and 4990 transitions. [2025-03-17 03:03:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:03:34,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-17 03:03:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:34,848 INFO L225 Difference]: With dead ends: 3567 [2025-03-17 03:03:34,848 INFO L226 Difference]: Without dead ends: 2362 [2025-03-17 03:03:34,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:03:34,851 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 356 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:34,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 718 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 03:03:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-03-17 03:03:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2067. [2025-03-17 03:03:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1772 states have (on average 1.353273137697517) internal successors, (2398), 1777 states have internal predecessors, (2398), 245 states have call successors, (245), 49 states have call predecessors, (245), 49 states have return successors, (245), 240 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-17 03:03:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2888 transitions. [2025-03-17 03:03:34,995 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2888 transitions. Word has length 209 [2025-03-17 03:03:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:34,996 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 2888 transitions. [2025-03-17 03:03:34,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2888 transitions. [2025-03-17 03:03:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:03:34,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:34,997 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:34,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 03:03:34,997 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:34,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:34,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1182141852, now seen corresponding path program 1 times [2025-03-17 03:03:34,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:34,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236803739] [2025-03-17 03:03:34,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:34,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:35,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:03:35,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:03:35,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:35,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:35,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:35,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236803739] [2025-03-17 03:03:35,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236803739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:35,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:03:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902855633] [2025-03-17 03:03:35,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:35,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:03:35,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:35,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:03:35,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:03:35,058 INFO L87 Difference]: Start difference. First operand 2067 states and 2888 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:35,313 INFO L93 Difference]: Finished difference Result 5665 states and 7885 transitions. [2025-03-17 03:03:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:03:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-17 03:03:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:35,325 INFO L225 Difference]: With dead ends: 5665 [2025-03-17 03:03:35,325 INFO L226 Difference]: Without dead ends: 3667 [2025-03-17 03:03:35,329 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-17 03:03:35,330 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 87 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:35,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 354 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:03:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states. [2025-03-17 03:03:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 3609. [2025-03-17 03:03:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3609 states, 3056 states have (on average 1.3324607329842932) internal successors, (4072), 3065 states have internal predecessors, (4072), 459 states have call successors, (459), 93 states have call predecessors, (459), 93 states have return successors, (459), 450 states have call predecessors, (459), 459 states have call successors, (459) [2025-03-17 03:03:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 4990 transitions. [2025-03-17 03:03:35,626 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 4990 transitions. Word has length 209 [2025-03-17 03:03:35,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:35,626 INFO L471 AbstractCegarLoop]: Abstraction has 3609 states and 4990 transitions. [2025-03-17 03:03:35,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 4990 transitions. [2025-03-17 03:03:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:03:35,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:35,628 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:35,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 03:03:35,628 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:35,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash -625312611, now seen corresponding path program 1 times [2025-03-17 03:03:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:35,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129370499] [2025-03-17 03:03:35,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:35,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:03:35,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:03:35,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:35,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129370499] [2025-03-17 03:03:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129370499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:37,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:37,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 03:03:37,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147305578] [2025-03-17 03:03:37,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:37,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 03:03:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:37,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 03:03:37,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:03:37,473 INFO L87 Difference]: Start difference. First operand 3609 states and 4990 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:38,718 INFO L93 Difference]: Finished difference Result 8768 states and 11958 transitions. [2025-03-17 03:03:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 03:03:38,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-03-17 03:03:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:38,732 INFO L225 Difference]: With dead ends: 8768 [2025-03-17 03:03:38,732 INFO L226 Difference]: Without dead ends: 5228 [2025-03-17 03:03:38,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 03:03:38,738 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 292 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:38,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1245 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:03:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2025-03-17 03:03:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 3481. [2025-03-17 03:03:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 2928 states have (on average 1.3271857923497268) internal successors, (3886), 2937 states have internal predecessors, (3886), 459 states have call successors, (459), 93 states have call predecessors, (459), 93 states have return successors, (459), 450 states have call predecessors, (459), 459 states have call successors, (459) [2025-03-17 03:03:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 4804 transitions. [2025-03-17 03:03:39,036 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 4804 transitions. Word has length 209 [2025-03-17 03:03:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:39,037 INFO L471 AbstractCegarLoop]: Abstraction has 3481 states and 4804 transitions. [2025-03-17 03:03:39,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 03:03:39,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 4804 transitions. [2025-03-17 03:03:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:03:39,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:39,038 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:39,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 03:03:39,038 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:39,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2079411876, now seen corresponding path program 1 times [2025-03-17 03:03:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:39,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072031775] [2025-03-17 03:03:39,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:39,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:03:39,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:03:39,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:39,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:03:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 03:03:39,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:03:39,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072031775] [2025-03-17 03:03:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072031775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:03:39,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:03:39,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:03:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484978323] [2025-03-17 03:03:39,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:03:39,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:03:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:03:39,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:03:39,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:03:39,379 INFO L87 Difference]: Start difference. First operand 3481 states and 4804 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:03:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:03:40,620 INFO L93 Difference]: Finished difference Result 5893 states and 8111 transitions. [2025-03-17 03:03:40,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:03:40,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 209 [2025-03-17 03:03:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:03:40,630 INFO L225 Difference]: With dead ends: 5893 [2025-03-17 03:03:40,631 INFO L226 Difference]: Without dead ends: 3956 [2025-03-17 03:03:40,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-17 03:03:40,637 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 553 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:03:40,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 866 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 03:03:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2025-03-17 03:03:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3553. [2025-03-17 03:03:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3000 states have (on average 1.328) internal successors, (3984), 3009 states have internal predecessors, (3984), 459 states have call successors, (459), 93 states have call predecessors, (459), 93 states have return successors, (459), 450 states have call predecessors, (459), 459 states have call successors, (459) [2025-03-17 03:03:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4902 transitions. [2025-03-17 03:03:41,026 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4902 transitions. Word has length 209 [2025-03-17 03:03:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:03:41,027 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 4902 transitions. [2025-03-17 03:03:41,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 03:03:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4902 transitions. [2025-03-17 03:03:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-17 03:03:41,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:03:41,028 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:03:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 03:03:41,029 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:03:41,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:03:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 408100957, now seen corresponding path program 1 times [2025-03-17 03:03:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:03:41,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683703077] [2025-03-17 03:03:41,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:03:41,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:03:41,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-17 03:03:41,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-17 03:03:41,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:03:41,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat