./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-22.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 a2f8cfcbb935c56cacc0dcdd0cb17c9fa32a1e539a6b0588fb3d51d3444efdea --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:30:46,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:30:46,900 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:30:46,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:30:46,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:30:46,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:30:46,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:30:46,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:30:46,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:30:46,931 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:30:46,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:30:46,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:30:46,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:30:46,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:30:46,933 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:30:46,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:30:46,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:30:46,933 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:30:46,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:30:46,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:30:46,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:30:46,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:30:46,934 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:46,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:30:46,934 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:30:46,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:30:46,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:30:46,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:30:46,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:30:46,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:30:46,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:30:46,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:30:46,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:30:46,935 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 -> a2f8cfcbb935c56cacc0dcdd0cb17c9fa32a1e539a6b0588fb3d51d3444efdea [2025-03-04 00:30:47,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:30:47,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:30:47,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:30:47,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:30:47,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:30:47,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-22.i [2025-03-04 00:30:48,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa31f1122/be54514c674843d0aba0abc68b572fd1/FLAG50718e495 [2025-03-04 00:30:48,702 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:30:48,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-22.i [2025-03-04 00:30:48,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa31f1122/be54514c674843d0aba0abc68b572fd1/FLAG50718e495 [2025-03-04 00:30:48,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa31f1122/be54514c674843d0aba0abc68b572fd1 [2025-03-04 00:30:48,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:30:48,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:30:48,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:48,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:30:48,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:30:48,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:48" (1/1) ... [2025-03-04 00:30:48,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d39f941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:48, skipping insertion in model container [2025-03-04 00:30:48,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:30:48" (1/1) ... [2025-03-04 00:30:48,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:30:48,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-22.i[916,929] [2025-03-04 00:30:49,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:49,065 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:30:49,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-22.i[916,929] [2025-03-04 00:30:49,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:30:49,162 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:30:49,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49 WrapperNode [2025-03-04 00:30:49,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:30:49,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:49,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:30:49,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:30:49,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,248 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 716 [2025-03-04 00:30:49,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:30:49,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:30:49,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:30:49,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:30:49,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,303 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:30:49,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,337 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:30:49,371 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:30:49,371 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:30:49,371 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:30:49,372 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (1/1) ... [2025-03-04 00:30:49,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:30:49,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:49,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:30:49,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:30:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:30:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:30:49,422 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:30:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:30:49,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:30:49,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:30:49,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:30:49,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:30:50,474 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc property_#t~bitwise43#1;havoc property_#t~ite48#1;havoc property_#t~ite47#1;havoc property_#t~ite46#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short49#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short52#1;havoc property_#t~bitwise53#1;havoc property_#t~short54#1;havoc property_#t~ite58#1;havoc property_#t~bitwise55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-03-04 00:30:50,593 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-03-04 00:30:50,593 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:30:50,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:30:50,619 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:30:50,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:50 BoogieIcfgContainer [2025-03-04 00:30:50,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:30:50,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:30:50,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:30:50,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:30:50,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:30:48" (1/3) ... [2025-03-04 00:30:50,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156d2303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:50, skipping insertion in model container [2025-03-04 00:30:50,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:30:49" (2/3) ... [2025-03-04 00:30:50,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156d2303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:30:50, skipping insertion in model container [2025-03-04 00:30:50,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:30:50" (3/3) ... [2025-03-04 00:30:50,626 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-22.i [2025-03-04 00:30:50,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:30:50,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-22.i that has 2 procedures, 284 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:30:50,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:30:50,701 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;@70390bbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:30:50,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:30:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 284 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 228 states have internal predecessors, (353), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:30:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-04 00:30:50,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:50,731 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:50,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 873774392, now seen corresponding path program 1 times [2025-03-04 00:30:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:50,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57463597] [2025-03-04 00:30:50,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:50,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-04 00:30:50,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-04 00:30:50,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:50,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-03-04 00:30:51,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:51,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57463597] [2025-03-04 00:30:51,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57463597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:30:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262525729] [2025-03-04 00:30:51,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:51,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:30:51,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:30:51,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:30:51,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:30:51,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-04 00:30:51,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-04 00:30:51,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:51,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:51,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:30:51,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:30:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2025-03-04 00:30:51,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:30:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262525729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:30:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:30:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443854560] [2025-03-04 00:30:51,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:51,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:30:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:51,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:30:51,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:30:51,632 INFO L87 Difference]: Start difference. First operand has 284 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 228 states have internal predecessors, (353), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:30:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:51,709 INFO L93 Difference]: Finished difference Result 562 states and 971 transitions. [2025-03-04 00:30:51,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:30:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) Word has length 401 [2025-03-04 00:30:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:51,718 INFO L225 Difference]: With dead ends: 562 [2025-03-04 00:30:51,720 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 00:30:51,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 402 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-04 00:30:51,726 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:51,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:30:51,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 00:30:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-04 00:30:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 225 states have (on average 1.5466666666666666) internal successors, (348), 225 states have internal predecessors, (348), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 00:30:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 456 transitions. [2025-03-04 00:30:51,790 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 456 transitions. Word has length 401 [2025-03-04 00:30:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:51,791 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 456 transitions. [2025-03-04 00:30:51,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (54), 2 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-04 00:30:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 456 transitions. [2025-03-04 00:30:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-04 00:30:51,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:51,800 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:51,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:30:52,000 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-04 00:30:52,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:52,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1120924850, now seen corresponding path program 1 times [2025-03-04 00:30:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:52,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515419745] [2025-03-04 00:30:52,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:52,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:52,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-04 00:30:52,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-04 00:30:52,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:52,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:30:52,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:52,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515419745] [2025-03-04 00:30:52,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515419745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:52,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:52,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490822519] [2025-03-04 00:30:52,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:52,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:52,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:52,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:52,480 INFO L87 Difference]: Start difference. First operand 281 states and 456 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:52,644 INFO L93 Difference]: Finished difference Result 809 states and 1317 transitions. [2025-03-04 00:30:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:52,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 401 [2025-03-04 00:30:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:52,651 INFO L225 Difference]: With dead ends: 809 [2025-03-04 00:30:52,652 INFO L226 Difference]: Without dead ends: 531 [2025-03-04 00:30:52,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:52,654 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 415 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:52,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 829 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-04 00:30:52,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 528. [2025-03-04 00:30:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 417 states have (on average 1.5323741007194245) internal successors, (639), 417 states have internal predecessors, (639), 108 states have call successors, (108), 2 states have call predecessors, (108), 2 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-04 00:30:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 855 transitions. [2025-03-04 00:30:52,720 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 855 transitions. Word has length 401 [2025-03-04 00:30:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:52,723 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 855 transitions. [2025-03-04 00:30:52,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 855 transitions. [2025-03-04 00:30:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-04 00:30:52,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:52,729 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:52,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:30:52,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:52,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1196976496, now seen corresponding path program 1 times [2025-03-04 00:30:52,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793342406] [2025-03-04 00:30:52,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:52,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-04 00:30:52,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-04 00:30:52,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:52,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:30:53,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:53,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793342406] [2025-03-04 00:30:53,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793342406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:53,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:53,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111648479] [2025-03-04 00:30:53,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:53,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:53,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:53,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:53,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:53,087 INFO L87 Difference]: Start difference. First operand 528 states and 855 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:53,201 INFO L93 Difference]: Finished difference Result 1447 states and 2343 transitions. [2025-03-04 00:30:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 401 [2025-03-04 00:30:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:53,210 INFO L225 Difference]: With dead ends: 1447 [2025-03-04 00:30:53,212 INFO L226 Difference]: Without dead ends: 922 [2025-03-04 00:30:53,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:53,214 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 330 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:53,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 857 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-04 00:30:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 918. [2025-03-04 00:30:53,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 765 states have (on average 1.5477124183006536) internal successors, (1184), 767 states have internal predecessors, (1184), 148 states have call successors, (148), 4 states have call predecessors, (148), 4 states have return successors, (148), 146 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-04 00:30:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1480 transitions. [2025-03-04 00:30:53,299 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1480 transitions. Word has length 401 [2025-03-04 00:30:53,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:53,300 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1480 transitions. [2025-03-04 00:30:53,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1480 transitions. [2025-03-04 00:30:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-04 00:30:53,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:53,308 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:53,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:30:53,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:53,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -259493709, now seen corresponding path program 1 times [2025-03-04 00:30:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178596412] [2025-03-04 00:30:53,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:53,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-04 00:30:53,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-04 00:30:53,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:53,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:30:53,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178596412] [2025-03-04 00:30:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178596412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:53,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:53,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:30:53,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983315411] [2025-03-04 00:30:53,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:53,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:30:53,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:53,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:30:53,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:53,606 INFO L87 Difference]: Start difference. First operand 918 states and 1480 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:53,719 INFO L93 Difference]: Finished difference Result 2589 states and 4178 transitions. [2025-03-04 00:30:53,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:30:53,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 401 [2025-03-04 00:30:53,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:53,735 INFO L225 Difference]: With dead ends: 2589 [2025-03-04 00:30:53,735 INFO L226 Difference]: Without dead ends: 1674 [2025-03-04 00:30:53,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:30:53,741 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 341 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:53,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1067 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:30:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2025-03-04 00:30:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1670. [2025-03-04 00:30:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1403 states have (on average 1.549536707056308) internal successors, (2174), 1409 states have internal predecessors, (2174), 258 states have call successors, (258), 8 states have call predecessors, (258), 8 states have return successors, (258), 252 states have call predecessors, (258), 258 states have call successors, (258) [2025-03-04 00:30:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2690 transitions. [2025-03-04 00:30:53,872 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2690 transitions. Word has length 401 [2025-03-04 00:30:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:53,873 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2690 transitions. [2025-03-04 00:30:53,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2690 transitions. [2025-03-04 00:30:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-04 00:30:53,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:53,881 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:53,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:30:53,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -722831661, now seen corresponding path program 1 times [2025-03-04 00:30:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008306180] [2025-03-04 00:30:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:53,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-04 00:30:54,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-04 00:30:54,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:54,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:30:54,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:54,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008306180] [2025-03-04 00:30:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008306180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:54,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:54,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:54,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877028854] [2025-03-04 00:30:54,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:54,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:54,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:54,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:54,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:54,442 INFO L87 Difference]: Start difference. First operand 1670 states and 2690 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:54,783 INFO L93 Difference]: Finished difference Result 4649 states and 7504 transitions. [2025-03-04 00:30:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 401 [2025-03-04 00:30:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:54,798 INFO L225 Difference]: With dead ends: 4649 [2025-03-04 00:30:54,798 INFO L226 Difference]: Without dead ends: 2982 [2025-03-04 00:30:54,803 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-04 00:30:54,804 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 555 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:54,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1291 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-03-04 00:30:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2628. [2025-03-04 00:30:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2304 states have (on average 1.5967881944444444) internal successors, (3679), 2310 states have internal predecessors, (3679), 312 states have call successors, (312), 11 states have call predecessors, (312), 11 states have return successors, (312), 306 states have call predecessors, (312), 312 states have call successors, (312) [2025-03-04 00:30:54,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 4303 transitions. [2025-03-04 00:30:54,914 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 4303 transitions. Word has length 401 [2025-03-04 00:30:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:54,915 INFO L471 AbstractCegarLoop]: Abstraction has 2628 states and 4303 transitions. [2025-03-04 00:30:54,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 4303 transitions. [2025-03-04 00:30:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-04 00:30:54,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:54,922 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:54,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:30:54,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:54,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash 400205829, now seen corresponding path program 1 times [2025-03-04 00:30:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:54,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142198498] [2025-03-04 00:30:54,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:54,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-04 00:30:55,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-04 00:30:55,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:55,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:30:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142198498] [2025-03-04 00:30:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142198498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:55,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:55,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:30:55,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729718691] [2025-03-04 00:30:55,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:55,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:30:55,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:55,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:30:55,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:30:55,447 INFO L87 Difference]: Start difference. First operand 2628 states and 4303 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:55,857 INFO L93 Difference]: Finished difference Result 5501 states and 8948 transitions. [2025-03-04 00:30:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:30:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 403 [2025-03-04 00:30:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:55,872 INFO L225 Difference]: With dead ends: 5501 [2025-03-04 00:30:55,872 INFO L226 Difference]: Without dead ends: 2983 [2025-03-04 00:30:55,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:30:55,879 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 561 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:55,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 2040 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-03-04 00:30:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2629. [2025-03-04 00:30:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2305 states have (on average 1.596529284164859) internal successors, (3680), 2311 states have internal predecessors, (3680), 312 states have call successors, (312), 11 states have call predecessors, (312), 11 states have return successors, (312), 306 states have call predecessors, (312), 312 states have call successors, (312) [2025-03-04 00:30:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4304 transitions. [2025-03-04 00:30:55,982 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4304 transitions. Word has length 403 [2025-03-04 00:30:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:55,983 INFO L471 AbstractCegarLoop]: Abstraction has 2629 states and 4304 transitions. [2025-03-04 00:30:55,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4304 transitions. [2025-03-04 00:30:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-04 00:30:55,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:55,988 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:55,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:30:55,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:55,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash -570085178, now seen corresponding path program 1 times [2025-03-04 00:30:55,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:55,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613780752] [2025-03-04 00:30:55,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:55,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:56,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-04 00:30:56,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-04 00:30:56,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:56,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:30:56,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613780752] [2025-03-04 00:30:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613780752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77360553] [2025-03-04 00:30:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:56,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:56,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:56,518 INFO L87 Difference]: Start difference. First operand 2629 states and 4304 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:56,920 INFO L93 Difference]: Finished difference Result 8872 states and 14547 transitions. [2025-03-04 00:30:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:56,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 403 [2025-03-04 00:30:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:56,950 INFO L225 Difference]: With dead ends: 8872 [2025-03-04 00:30:56,951 INFO L226 Difference]: Without dead ends: 6353 [2025-03-04 00:30:56,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-04 00:30:56,958 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 648 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:56,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1555 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2025-03-04 00:30:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 6005. [2025-03-04 00:30:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6005 states, 5415 states have (on average 1.6145891043397969) internal successors, (8743), 5427 states have internal predecessors, (8743), 570 states have call successors, (570), 19 states have call predecessors, (570), 19 states have return successors, (570), 558 states have call predecessors, (570), 570 states have call successors, (570) [2025-03-04 00:30:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6005 states to 6005 states and 9883 transitions. [2025-03-04 00:30:57,167 INFO L78 Accepts]: Start accepts. Automaton has 6005 states and 9883 transitions. Word has length 403 [2025-03-04 00:30:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:57,168 INFO L471 AbstractCegarLoop]: Abstraction has 6005 states and 9883 transitions. [2025-03-04 00:30:57,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 6005 states and 9883 transitions. [2025-03-04 00:30:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 00:30:57,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:57,174 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:57,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:30:57,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1011847042, now seen corresponding path program 1 times [2025-03-04 00:30:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561604211] [2025-03-04 00:30:57,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:57,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:30:57,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:30:57,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:57,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:30:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561604211] [2025-03-04 00:30:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561604211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:30:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349885569] [2025-03-04 00:30:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:57,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:30:57,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:57,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:30:57,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:30:57,619 INFO L87 Difference]: Start difference. First operand 6005 states and 9883 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:58,119 INFO L93 Difference]: Finished difference Result 8034 states and 13075 transitions. [2025-03-04 00:30:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:30:58,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 405 [2025-03-04 00:30:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:58,141 INFO L225 Difference]: With dead ends: 8034 [2025-03-04 00:30:58,141 INFO L226 Difference]: Without dead ends: 5508 [2025-03-04 00:30:58,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:30:58,149 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 546 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:58,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 2045 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:30:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5508 states. [2025-03-04 00:30:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5508 to 5154. [2025-03-04 00:30:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 4564 states have (on average 1.5975021910604732) internal successors, (7291), 4576 states have internal predecessors, (7291), 570 states have call successors, (570), 19 states have call predecessors, (570), 19 states have return successors, (570), 558 states have call predecessors, (570), 570 states have call successors, (570) [2025-03-04 00:30:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 8431 transitions. [2025-03-04 00:30:58,312 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 8431 transitions. Word has length 405 [2025-03-04 00:30:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:58,312 INFO L471 AbstractCegarLoop]: Abstraction has 5154 states and 8431 transitions. [2025-03-04 00:30:58,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:58,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 8431 transitions. [2025-03-04 00:30:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 00:30:58,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:58,316 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:58,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:30:58,316 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:58,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1026097187, now seen corresponding path program 1 times [2025-03-04 00:30:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240400062] [2025-03-04 00:30:58,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:58,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:30:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:30:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:30:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:30:59,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:30:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240400062] [2025-03-04 00:30:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240400062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:30:59,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:30:59,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:30:59,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037951813] [2025-03-04 00:30:59,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:30:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:30:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:30:59,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:30:59,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:30:59,072 INFO L87 Difference]: Start difference. First operand 5154 states and 8431 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:30:59,490 INFO L93 Difference]: Finished difference Result 14732 states and 24149 transitions. [2025-03-04 00:30:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:30:59,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 405 [2025-03-04 00:30:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:30:59,538 INFO L225 Difference]: With dead ends: 14732 [2025-03-04 00:30:59,539 INFO L226 Difference]: Without dead ends: 9999 [2025-03-04 00:30:59,554 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-04 00:30:59,555 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 317 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:30:59,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1184 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:30:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2025-03-04 00:30:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 9997. [2025-03-04 00:30:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 8875 states have (on average 1.5971830985915494) internal successors, (14175), 8899 states have internal predecessors, (14175), 1086 states have call successors, (1086), 35 states have call predecessors, (1086), 35 states have return successors, (1086), 1062 states have call predecessors, (1086), 1086 states have call successors, (1086) [2025-03-04 00:30:59,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 16347 transitions. [2025-03-04 00:30:59,900 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 16347 transitions. Word has length 405 [2025-03-04 00:30:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:30:59,901 INFO L471 AbstractCegarLoop]: Abstraction has 9997 states and 16347 transitions. [2025-03-04 00:30:59,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:30:59,902 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 16347 transitions. [2025-03-04 00:30:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 00:30:59,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:30:59,906 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:30:59,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:30:59,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:30:59,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:30:59,907 INFO L85 PathProgramCache]: Analyzing trace with hash 107093406, now seen corresponding path program 1 times [2025-03-04 00:30:59,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:30:59,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749320119] [2025-03-04 00:30:59,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:30:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:30:59,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:30:59,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:30:59,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:30:59,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:00,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:00,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749320119] [2025-03-04 00:31:00,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749320119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:00,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:00,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:00,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598341250] [2025-03-04 00:31:00,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:00,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:00,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:00,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:00,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:00,397 INFO L87 Difference]: Start difference. First operand 9997 states and 16347 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:00,915 INFO L93 Difference]: Finished difference Result 19551 states and 31849 transitions. [2025-03-04 00:31:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:00,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 405 [2025-03-04 00:31:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:00,943 INFO L225 Difference]: With dead ends: 19551 [2025-03-04 00:31:00,944 INFO L226 Difference]: Without dead ends: 10511 [2025-03-04 00:31:00,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:00,959 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 367 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:00,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1232 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10511 states. [2025-03-04 00:31:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10511 to 9997. [2025-03-04 00:31:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 8875 states have (on average 1.5967323943661973) internal successors, (14171), 8899 states have internal predecessors, (14171), 1086 states have call successors, (1086), 35 states have call predecessors, (1086), 35 states have return successors, (1086), 1062 states have call predecessors, (1086), 1086 states have call successors, (1086) [2025-03-04 00:31:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 16343 transitions. [2025-03-04 00:31:01,431 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 16343 transitions. Word has length 405 [2025-03-04 00:31:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:01,432 INFO L471 AbstractCegarLoop]: Abstraction has 9997 states and 16343 transitions. [2025-03-04 00:31:01,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 16343 transitions. [2025-03-04 00:31:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 00:31:01,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:01,437 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:01,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:31:01,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:01,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:01,437 INFO L85 PathProgramCache]: Analyzing trace with hash 208005373, now seen corresponding path program 1 times [2025-03-04 00:31:01,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:01,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370147142] [2025-03-04 00:31:01,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:01,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:31:02,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:31:02,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:02,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 36 proven. 123 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370147142] [2025-03-04 00:31:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370147142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:03,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975446739] [2025-03-04 00:31:03,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:03,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:03,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:03,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:03,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:31:03,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:31:03,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:31:03,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:03,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:03,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:31:03,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2045 proven. 123 refuted. 0 times theorem prover too weak. 3556 trivial. 0 not checked. [2025-03-04 00:31:04,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 36 proven. 123 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975446739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:05,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2025-03-04 00:31:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370586864] [2025-03-04 00:31:05,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:05,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 00:31:05,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:05,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 00:31:05,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:31:05,488 INFO L87 Difference]: Start difference. First operand 9997 states and 16343 transitions. Second operand has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 4 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-03-04 00:31:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:07,770 INFO L93 Difference]: Finished difference Result 24125 states and 38844 transitions. [2025-03-04 00:31:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 00:31:07,771 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 4 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) Word has length 405 [2025-03-04 00:31:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:07,815 INFO L225 Difference]: With dead ends: 24125 [2025-03-04 00:31:07,815 INFO L226 Difference]: Without dead ends: 15029 [2025-03-04 00:31:07,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=2085, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 00:31:07,842 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 4992 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:07,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5058 Valid, 3706 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:31:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15029 states. [2025-03-04 00:31:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15029 to 13777. [2025-03-04 00:31:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13777 states, 12301 states have (on average 1.5832046175107715) internal successors, (19475), 12349 states have internal predecessors, (19475), 1406 states have call successors, (1406), 69 states have call predecessors, (1406), 69 states have return successors, (1406), 1358 states have call predecessors, (1406), 1406 states have call successors, (1406) [2025-03-04 00:31:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13777 states to 13777 states and 22287 transitions. [2025-03-04 00:31:08,318 INFO L78 Accepts]: Start accepts. Automaton has 13777 states and 22287 transitions. Word has length 405 [2025-03-04 00:31:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:08,320 INFO L471 AbstractCegarLoop]: Abstraction has 13777 states and 22287 transitions. [2025-03-04 00:31:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 4 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-03-04 00:31:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13777 states and 22287 transitions. [2025-03-04 00:31:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2025-03-04 00:31:08,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:08,330 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:08,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:31:08,534 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,SelfDestructingSolverStorable10 [2025-03-04 00:31:08,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:08,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1277050178, now seen corresponding path program 1 times [2025-03-04 00:31:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364415077] [2025-03-04 00:31:08,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:31:09,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:31:09,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:09,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 48 proven. 111 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364415077] [2025-03-04 00:31:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364415077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:09,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081391479] [2025-03-04 00:31:09,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:09,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:09,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:09,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:09,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:31:09,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 405 statements into 1 equivalence classes. [2025-03-04 00:31:10,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 405 of 405 statements. [2025-03-04 00:31:10,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:10,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:10,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:31:10,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2643 proven. 54 refuted. 0 times theorem prover too weak. 3027 trivial. 0 not checked. [2025-03-04 00:31:10,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 105 proven. 54 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081391479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:10,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:10,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-04 00:31:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280951339] [2025-03-04 00:31:10,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:10,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:31:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:10,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:31:10,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:31:10,560 INFO L87 Difference]: Start difference. First operand 13777 states and 22287 transitions. Second operand has 12 states, 11 states have (on average 19.09090909090909) internal successors, (210), 12 states have internal predecessors, (210), 5 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 4 states have call predecessors, (127), 5 states have call successors, (127) [2025-03-04 00:31:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:11,649 INFO L93 Difference]: Finished difference Result 19513 states and 31457 transitions. [2025-03-04 00:31:11,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 00:31:11,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 19.09090909090909) internal successors, (210), 12 states have internal predecessors, (210), 5 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 4 states have call predecessors, (127), 5 states have call successors, (127) Word has length 405 [2025-03-04 00:31:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:11,674 INFO L225 Difference]: With dead ends: 19513 [2025-03-04 00:31:11,675 INFO L226 Difference]: Without dead ends: 5997 [2025-03-04 00:31:11,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 807 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2025-03-04 00:31:11,696 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1416 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:11,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 2290 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:31:11,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2025-03-04 00:31:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 5589. [2025-03-04 00:31:11,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5589 states, 4903 states have (on average 1.5676116663267388) internal successors, (7686), 4911 states have internal predecessors, (7686), 646 states have call successors, (646), 39 states have call predecessors, (646), 39 states have return successors, (646), 638 states have call predecessors, (646), 646 states have call successors, (646) [2025-03-04 00:31:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5589 states to 5589 states and 8978 transitions. [2025-03-04 00:31:11,961 INFO L78 Accepts]: Start accepts. Automaton has 5589 states and 8978 transitions. Word has length 405 [2025-03-04 00:31:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:11,962 INFO L471 AbstractCegarLoop]: Abstraction has 5589 states and 8978 transitions. [2025-03-04 00:31:11,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 19.09090909090909) internal successors, (210), 12 states have internal predecessors, (210), 5 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (127), 4 states have call predecessors, (127), 5 states have call successors, (127) [2025-03-04 00:31:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 5589 states and 8978 transitions. [2025-03-04 00:31:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-04 00:31:11,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:11,965 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:11,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:31:12,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:12,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1958441076, now seen corresponding path program 1 times [2025-03-04 00:31:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206517595] [2025-03-04 00:31:12,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:12,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:31:13,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:31:13,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 60 proven. 99 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:13,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206517595] [2025-03-04 00:31:13,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206517595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:13,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603955134] [2025-03-04 00:31:13,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:13,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:13,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:13,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:31:13,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:31:13,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:31:13,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:13,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:13,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:31:13,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2885 proven. 87 refuted. 0 times theorem prover too weak. 2752 trivial. 0 not checked. [2025-03-04 00:31:14,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 72 proven. 87 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603955134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:14,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 00:31:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018506712] [2025-03-04 00:31:14,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:14,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:31:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:14,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:31:14,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:31:14,329 INFO L87 Difference]: Start difference. First operand 5589 states and 8978 transitions. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 4 states have call predecessors, (118), 4 states have call successors, (118) [2025-03-04 00:31:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:14,961 INFO L93 Difference]: Finished difference Result 8519 states and 13617 transitions. [2025-03-04 00:31:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:31:14,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 4 states have call predecessors, (118), 4 states have call successors, (118) Word has length 406 [2025-03-04 00:31:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:14,973 INFO L225 Difference]: With dead ends: 8519 [2025-03-04 00:31:14,973 INFO L226 Difference]: Without dead ends: 3279 [2025-03-04 00:31:14,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:31:14,979 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 846 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:14,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1035 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:31:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-03-04 00:31:15,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3241. [2025-03-04 00:31:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 2705 states have (on average 1.511275415896488) internal successors, (4088), 2705 states have internal predecessors, (4088), 486 states have call successors, (486), 49 states have call predecessors, (486), 49 states have return successors, (486), 486 states have call predecessors, (486), 486 states have call successors, (486) [2025-03-04 00:31:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5060 transitions. [2025-03-04 00:31:15,112 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5060 transitions. Word has length 406 [2025-03-04 00:31:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:15,114 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5060 transitions. [2025-03-04 00:31:15,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (116), 2 states have call predecessors, (116), 4 states have return successors, (118), 4 states have call predecessors, (118), 4 states have call successors, (118) [2025-03-04 00:31:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5060 transitions. [2025-03-04 00:31:15,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:15,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:15,118 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:15,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:31:15,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:15,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:15,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:15,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1584309431, now seen corresponding path program 1 times [2025-03-04 00:31:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:15,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771278531] [2025-03-04 00:31:15,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:15,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:15,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:15,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:15,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:15,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:15,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:15,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771278531] [2025-03-04 00:31:15,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771278531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:15,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:15,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:31:15,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808586872] [2025-03-04 00:31:15,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:15,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:31:15,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:15,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:31:15,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:31:15,761 INFO L87 Difference]: Start difference. First operand 3241 states and 5060 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:16,731 INFO L93 Difference]: Finished difference Result 8413 states and 12958 transitions. [2025-03-04 00:31:16,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:31:16,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:16,747 INFO L225 Difference]: With dead ends: 8413 [2025-03-04 00:31:16,747 INFO L226 Difference]: Without dead ends: 5605 [2025-03-04 00:31:16,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:31:16,752 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 1486 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:16,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1945 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:31:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5605 states. [2025-03-04 00:31:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5605 to 3463. [2025-03-04 00:31:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 2927 states have (on average 1.5244277417150667) internal successors, (4462), 2927 states have internal predecessors, (4462), 486 states have call successors, (486), 49 states have call predecessors, (486), 49 states have return successors, (486), 486 states have call predecessors, (486), 486 states have call successors, (486) [2025-03-04 00:31:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 5434 transitions. [2025-03-04 00:31:16,914 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 5434 transitions. Word has length 408 [2025-03-04 00:31:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:16,914 INFO L471 AbstractCegarLoop]: Abstraction has 3463 states and 5434 transitions. [2025-03-04 00:31:16,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 5434 transitions. [2025-03-04 00:31:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:16,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:16,917 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:16,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:31:16,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:16,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1313138344, now seen corresponding path program 1 times [2025-03-04 00:31:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:16,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656517542] [2025-03-04 00:31:16,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:16,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:16,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:16,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:16,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656517542] [2025-03-04 00:31:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656517542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:31:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908394332] [2025-03-04 00:31:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:17,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:17,222 INFO L87 Difference]: Start difference. First operand 3463 states and 5434 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:17,607 INFO L93 Difference]: Finished difference Result 9729 states and 15191 transitions. [2025-03-04 00:31:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:17,624 INFO L225 Difference]: With dead ends: 9729 [2025-03-04 00:31:17,624 INFO L226 Difference]: Without dead ends: 6925 [2025-03-04 00:31:17,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:31:17,630 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 828 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:17,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1376 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6925 states. [2025-03-04 00:31:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6925 to 6265. [2025-03-04 00:31:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6265 states, 5257 states have (on average 1.5134106905078943) internal successors, (7956), 5257 states have internal predecessors, (7956), 918 states have call successors, (918), 89 states have call predecessors, (918), 89 states have return successors, (918), 918 states have call predecessors, (918), 918 states have call successors, (918) [2025-03-04 00:31:17,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6265 states to 6265 states and 9792 transitions. [2025-03-04 00:31:17,864 INFO L78 Accepts]: Start accepts. Automaton has 6265 states and 9792 transitions. Word has length 408 [2025-03-04 00:31:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:17,865 INFO L471 AbstractCegarLoop]: Abstraction has 6265 states and 9792 transitions. [2025-03-04 00:31:17,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6265 states and 9792 transitions. [2025-03-04 00:31:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:17,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:17,868 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:17,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:31:17,868 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:17,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash -620036647, now seen corresponding path program 1 times [2025-03-04 00:31:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207672749] [2025-03-04 00:31:17,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:17,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:17,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:18,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:19,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207672749] [2025-03-04 00:31:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207672749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:19,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808640018] [2025-03-04 00:31:19,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:19,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:19,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:19,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:19,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:31:19,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:19,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:19,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:19,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:19,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:31:19,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 563 proven. 6 refuted. 0 times theorem prover too weak. 5155 trivial. 0 not checked. [2025-03-04 00:31:19,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:19,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808640018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:19,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:19,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:31:19,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359144038] [2025-03-04 00:31:19,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:19,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:31:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:19,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:31:19,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:31:19,862 INFO L87 Difference]: Start difference. First operand 6265 states and 9792 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-04 00:31:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:20,343 INFO L93 Difference]: Finished difference Result 12331 states and 19184 transitions. [2025-03-04 00:31:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:31:20,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 408 [2025-03-04 00:31:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:20,365 INFO L225 Difference]: With dead ends: 12331 [2025-03-04 00:31:20,365 INFO L226 Difference]: Without dead ends: 6433 [2025-03-04 00:31:20,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 823 GetRequests, 813 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:31:20,373 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 602 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:20,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1000 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6433 states. [2025-03-04 00:31:20,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6433 to 6111. [2025-03-04 00:31:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6111 states, 5086 states have (on average 1.4842705465985058) internal successors, (7549), 5086 states have internal predecessors, (7549), 918 states have call successors, (918), 106 states have call predecessors, (918), 106 states have return successors, (918), 918 states have call predecessors, (918), 918 states have call successors, (918) [2025-03-04 00:31:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 9385 transitions. [2025-03-04 00:31:20,626 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 9385 transitions. Word has length 408 [2025-03-04 00:31:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:20,627 INFO L471 AbstractCegarLoop]: Abstraction has 6111 states and 9385 transitions. [2025-03-04 00:31:20,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-04 00:31:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 9385 transitions. [2025-03-04 00:31:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:20,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:20,630 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:20,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:31:20,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 00:31:20,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:20,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:20,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1390276905, now seen corresponding path program 1 times [2025-03-04 00:31:20,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51469072] [2025-03-04 00:31:20,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:20,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:20,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:20,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:20,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:21,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:21,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51469072] [2025-03-04 00:31:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51469072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:21,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:21,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:31:21,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623417056] [2025-03-04 00:31:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:21,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:21,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:21,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:21,415 INFO L87 Difference]: Start difference. First operand 6111 states and 9385 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:21,747 INFO L93 Difference]: Finished difference Result 9887 states and 15223 transitions. [2025-03-04 00:31:21,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:31:21,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:21,758 INFO L225 Difference]: With dead ends: 9887 [2025-03-04 00:31:21,758 INFO L226 Difference]: Without dead ends: 3379 [2025-03-04 00:31:21,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:21,762 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 433 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:21,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1288 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2025-03-04 00:31:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3193. [2025-03-04 00:31:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 2640 states have (on average 1.465530303030303) internal successors, (3869), 2640 states have internal predecessors, (3869), 486 states have call successors, (486), 66 states have call predecessors, (486), 66 states have return successors, (486), 486 states have call predecessors, (486), 486 states have call successors, (486) [2025-03-04 00:31:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4841 transitions. [2025-03-04 00:31:21,963 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4841 transitions. Word has length 408 [2025-03-04 00:31:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:21,963 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4841 transitions. [2025-03-04 00:31:21,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4841 transitions. [2025-03-04 00:31:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:21,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:21,967 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:21,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:31:21,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:21,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash -992750601, now seen corresponding path program 1 times [2025-03-04 00:31:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:21,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453932593] [2025-03-04 00:31:21,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:21,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:22,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:22,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:22,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:22,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:22,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453932593] [2025-03-04 00:31:22,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453932593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:22,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:31:22,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573018951] [2025-03-04 00:31:22,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:31:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:22,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:31:22,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:31:22,650 INFO L87 Difference]: Start difference. First operand 3193 states and 4841 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:23,252 INFO L93 Difference]: Finished difference Result 8888 states and 13498 transitions. [2025-03-04 00:31:23,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:31:23,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:23,268 INFO L225 Difference]: With dead ends: 8888 [2025-03-04 00:31:23,268 INFO L226 Difference]: Without dead ends: 6023 [2025-03-04 00:31:23,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:31:23,275 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1296 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:23,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1929 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:31:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2025-03-04 00:31:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 5077. [2025-03-04 00:31:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5077 states, 4392 states have (on average 1.4943078324225865) internal successors, (6563), 4400 states have internal predecessors, (6563), 606 states have call successors, (606), 78 states have call predecessors, (606), 78 states have return successors, (606), 598 states have call predecessors, (606), 606 states have call successors, (606) [2025-03-04 00:31:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5077 states to 5077 states and 7775 transitions. [2025-03-04 00:31:23,481 INFO L78 Accepts]: Start accepts. Automaton has 5077 states and 7775 transitions. Word has length 408 [2025-03-04 00:31:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:23,482 INFO L471 AbstractCegarLoop]: Abstraction has 5077 states and 7775 transitions. [2025-03-04 00:31:23,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5077 states and 7775 transitions. [2025-03-04 00:31:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:23,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:23,485 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:23,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 00:31:23,485 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:23,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash -223580586, now seen corresponding path program 1 times [2025-03-04 00:31:23,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:23,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701377916] [2025-03-04 00:31:23,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:23,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:23,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:23,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:23,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:23,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:23,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701377916] [2025-03-04 00:31:23,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701377916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:23,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:23,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:31:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798934303] [2025-03-04 00:31:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:23,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:23,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:23,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:23,940 INFO L87 Difference]: Start difference. First operand 5077 states and 7775 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:24,679 INFO L93 Difference]: Finished difference Result 10965 states and 16698 transitions. [2025-03-04 00:31:24,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:31:24,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:24,694 INFO L225 Difference]: With dead ends: 10965 [2025-03-04 00:31:24,694 INFO L226 Difference]: Without dead ends: 6333 [2025-03-04 00:31:24,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:31:24,702 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 947 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:24,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1443 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:31:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2025-03-04 00:31:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 5286. [2025-03-04 00:31:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 4601 states have (on average 1.4992392958052598) internal successors, (6898), 4609 states have internal predecessors, (6898), 606 states have call successors, (606), 78 states have call predecessors, (606), 78 states have return successors, (606), 598 states have call predecessors, (606), 606 states have call successors, (606) [2025-03-04 00:31:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 8110 transitions. [2025-03-04 00:31:24,929 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 8110 transitions. Word has length 408 [2025-03-04 00:31:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:24,930 INFO L471 AbstractCegarLoop]: Abstraction has 5286 states and 8110 transitions. [2025-03-04 00:31:24,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 8110 transitions. [2025-03-04 00:31:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:24,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:24,933 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:24,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 00:31:24,933 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:24,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1867040632, now seen corresponding path program 1 times [2025-03-04 00:31:24,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:24,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825424344] [2025-03-04 00:31:24,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:24,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:24,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:26,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:26,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:26,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 93 proven. 66 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:31:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825424344] [2025-03-04 00:31:26,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825424344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662469847] [2025-03-04 00:31:26,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:26,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:26,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:26,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:31:26,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:31:26,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:27,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:27,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:27,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:27,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 00:31:27,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 4282 proven. 258 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2025-03-04 00:31:29,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:31:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 366 proven. 102 refuted. 0 times theorem prover too weak. 5256 trivial. 0 not checked. [2025-03-04 00:31:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662469847] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:31:30,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:31:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 22] total 55 [2025-03-04 00:31:30,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754559173] [2025-03-04 00:31:30,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:31:30,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 00:31:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:30,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 00:31:30,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2506, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 00:31:30,590 INFO L87 Difference]: Start difference. First operand 5286 states and 8110 transitions. Second operand has 55 states, 55 states have (on average 7.2727272727272725) internal successors, (400), 55 states have internal predecessors, (400), 15 states have call successors, (162), 7 states have call predecessors, (162), 16 states have return successors, (162), 15 states have call predecessors, (162), 15 states have call successors, (162) [2025-03-04 00:31:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:46,604 INFO L93 Difference]: Finished difference Result 26054 states and 39185 transitions. [2025-03-04 00:31:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2025-03-04 00:31:46,605 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 7.2727272727272725) internal successors, (400), 55 states have internal predecessors, (400), 15 states have call successors, (162), 7 states have call predecessors, (162), 16 states have return successors, (162), 15 states have call predecessors, (162), 15 states have call successors, (162) Word has length 408 [2025-03-04 00:31:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:46,648 INFO L225 Difference]: With dead ends: 26054 [2025-03-04 00:31:46,649 INFO L226 Difference]: Without dead ends: 21244 [2025-03-04 00:31:46,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 811 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18709 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8661, Invalid=42189, Unknown=0, NotChecked=0, Total=50850 [2025-03-04 00:31:46,671 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 16716 mSDsluCounter, 19377 mSDsCounter, 0 mSdLazyCounter, 13770 mSolverCounterSat, 3429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16792 SdHoareTripleChecker+Valid, 20073 SdHoareTripleChecker+Invalid, 17199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3429 IncrementalHoareTripleChecker+Valid, 13770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:46,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16792 Valid, 20073 Invalid, 17199 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3429 Valid, 13770 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2025-03-04 00:31:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21244 states. [2025-03-04 00:31:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21244 to 13344. [2025-03-04 00:31:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13344 states, 11395 states have (on average 1.4794207985958754) internal successors, (16858), 11423 states have internal predecessors, (16858), 1686 states have call successors, (1686), 262 states have call predecessors, (1686), 262 states have return successors, (1686), 1658 states have call predecessors, (1686), 1686 states have call successors, (1686) [2025-03-04 00:31:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13344 states to 13344 states and 20230 transitions. [2025-03-04 00:31:47,490 INFO L78 Accepts]: Start accepts. Automaton has 13344 states and 20230 transitions. Word has length 408 [2025-03-04 00:31:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:47,490 INFO L471 AbstractCegarLoop]: Abstraction has 13344 states and 20230 transitions. [2025-03-04 00:31:47,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 7.2727272727272725) internal successors, (400), 55 states have internal predecessors, (400), 15 states have call successors, (162), 7 states have call predecessors, (162), 16 states have return successors, (162), 15 states have call predecessors, (162), 15 states have call successors, (162) [2025-03-04 00:31:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 13344 states and 20230 transitions. [2025-03-04 00:31:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:47,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:47,494 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:47,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:31:47,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:47,695 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:47,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1539507318, now seen corresponding path program 1 times [2025-03-04 00:31:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:47,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729326589] [2025-03-04 00:31:47,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:47,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:47,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:47,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:47,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:47,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:47,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729326589] [2025-03-04 00:31:47,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729326589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:47,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:47,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072961439] [2025-03-04 00:31:47,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:47,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:47,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:47,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:47,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:47,894 INFO L87 Difference]: Start difference. First operand 13344 states and 20230 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:48,998 INFO L93 Difference]: Finished difference Result 34632 states and 52700 transitions. [2025-03-04 00:31:48,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:48,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:49,040 INFO L225 Difference]: With dead ends: 34632 [2025-03-04 00:31:49,041 INFO L226 Difference]: Without dead ends: 21556 [2025-03-04 00:31:49,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:49,056 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 295 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:49,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 817 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21556 states. [2025-03-04 00:31:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21556 to 16424. [2025-03-04 00:31:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16424 states, 14475 states have (on average 1.4841450777202072) internal successors, (21483), 14503 states have internal predecessors, (21483), 1686 states have call successors, (1686), 262 states have call predecessors, (1686), 262 states have return successors, (1686), 1658 states have call predecessors, (1686), 1686 states have call successors, (1686) [2025-03-04 00:31:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16424 states to 16424 states and 24855 transitions. [2025-03-04 00:31:49,900 INFO L78 Accepts]: Start accepts. Automaton has 16424 states and 24855 transitions. Word has length 408 [2025-03-04 00:31:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:49,901 INFO L471 AbstractCegarLoop]: Abstraction has 16424 states and 24855 transitions. [2025-03-04 00:31:49,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16424 states and 24855 transitions. [2025-03-04 00:31:49,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:49,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:49,905 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:49,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 00:31:49,905 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 569216311, now seen corresponding path program 1 times [2025-03-04 00:31:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:49,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19949969] [2025-03-04 00:31:49,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:49,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:49,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:49,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:49,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:50,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19949969] [2025-03-04 00:31:50,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19949969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:50,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:50,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:50,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271143995] [2025-03-04 00:31:50,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:50,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:50,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:50,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:50,021 INFO L87 Difference]: Start difference. First operand 16424 states and 24855 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:50,930 INFO L93 Difference]: Finished difference Result 33995 states and 51457 transitions. [2025-03-04 00:31:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:50,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:50,971 INFO L225 Difference]: With dead ends: 33995 [2025-03-04 00:31:50,972 INFO L226 Difference]: Without dead ends: 18153 [2025-03-04 00:31:50,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:50,991 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 298 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:50,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1003 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:31:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18153 states. [2025-03-04 00:31:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18153 to 15223. [2025-03-04 00:31:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15223 states, 13274 states have (on average 1.4638390839234594) internal successors, (19431), 13302 states have internal predecessors, (19431), 1686 states have call successors, (1686), 262 states have call predecessors, (1686), 262 states have return successors, (1686), 1658 states have call predecessors, (1686), 1686 states have call successors, (1686) [2025-03-04 00:31:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 22803 transitions. [2025-03-04 00:31:52,080 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 22803 transitions. Word has length 408 [2025-03-04 00:31:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:52,080 INFO L471 AbstractCegarLoop]: Abstraction has 15223 states and 22803 transitions. [2025-03-04 00:31:52,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 22803 transitions. [2025-03-04 00:31:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:52,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:52,086 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:52,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 00:31:52,086 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:52,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1919943763, now seen corresponding path program 1 times [2025-03-04 00:31:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:52,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147791926] [2025-03-04 00:31:52,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:52,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:52,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:52,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:52,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:52,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147791926] [2025-03-04 00:31:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147791926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:52,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:52,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711816582] [2025-03-04 00:31:52,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:52,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:52,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:52,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:52,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:52,783 INFO L87 Difference]: Start difference. First operand 15223 states and 22803 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:53,817 INFO L93 Difference]: Finished difference Result 32335 states and 48510 transitions. [2025-03-04 00:31:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:53,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:53,858 INFO L225 Difference]: With dead ends: 32335 [2025-03-04 00:31:53,858 INFO L226 Difference]: Without dead ends: 18153 [2025-03-04 00:31:53,877 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-04 00:31:53,878 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 305 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:53,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1602 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18153 states. [2025-03-04 00:31:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18153 to 15223. [2025-03-04 00:31:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15223 states, 13274 states have (on average 1.4607503390085883) internal successors, (19390), 13302 states have internal predecessors, (19390), 1686 states have call successors, (1686), 262 states have call predecessors, (1686), 262 states have return successors, (1686), 1658 states have call predecessors, (1686), 1686 states have call successors, (1686) [2025-03-04 00:31:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 22762 transitions. [2025-03-04 00:31:54,663 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 22762 transitions. Word has length 408 [2025-03-04 00:31:54,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:54,664 INFO L471 AbstractCegarLoop]: Abstraction has 15223 states and 22762 transitions. [2025-03-04 00:31:54,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 22762 transitions. [2025-03-04 00:31:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:54,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:54,668 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:54,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 00:31:54,668 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:54,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1933476564, now seen corresponding path program 1 times [2025-03-04 00:31:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:54,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379633387] [2025-03-04 00:31:54,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:54,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:31:54,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:31:54,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:54,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5724 trivial. 0 not checked. [2025-03-04 00:31:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379633387] [2025-03-04 00:31:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379633387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:55,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:31:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081789754] [2025-03-04 00:31:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:31:55,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:31:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:31:55,785 INFO L87 Difference]: Start difference. First operand 15223 states and 22762 transitions. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:58,211 INFO L93 Difference]: Finished difference Result 45816 states and 69058 transitions. [2025-03-04 00:31:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:31:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) Word has length 408 [2025-03-04 00:31:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:58,274 INFO L225 Difference]: With dead ends: 45816 [2025-03-04 00:31:58,275 INFO L226 Difference]: Without dead ends: 31956 [2025-03-04 00:31:58,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:31:58,298 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 2499 mSDsluCounter, 3202 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:58,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 3880 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:31:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31956 states. [2025-03-04 00:31:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31956 to 23459. [2025-03-04 00:31:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23459 states, 20274 states have (on average 1.4591595146493046) internal successors, (29583), 20322 states have internal predecessors, (29583), 2770 states have call successors, (2770), 414 states have call predecessors, (2770), 414 states have return successors, (2770), 2722 states have call predecessors, (2770), 2770 states have call successors, (2770) [2025-03-04 00:31:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23459 states to 23459 states and 35123 transitions. [2025-03-04 00:31:59,658 INFO L78 Accepts]: Start accepts. Automaton has 23459 states and 35123 transitions. Word has length 408 [2025-03-04 00:31:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:59,658 INFO L471 AbstractCegarLoop]: Abstraction has 23459 states and 35123 transitions. [2025-03-04 00:31:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 1 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 1 states have call predecessors, (54), 1 states have call successors, (54) [2025-03-04 00:31:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 23459 states and 35123 transitions. [2025-03-04 00:31:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-04 00:31:59,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:59,662 INFO L218 NwaCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:31:59,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 00:31:59,663 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:59,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1484779925, now seen corresponding path program 1 times [2025-03-04 00:31:59,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:59,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544115093] [2025-03-04 00:31:59,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:59,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:59,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:32:00,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:32:00,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:00,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 54 proven. 105 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2025-03-04 00:32:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544115093] [2025-03-04 00:32:00,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544115093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:32:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619045879] [2025-03-04 00:32:00,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:00,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:00,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:00,516 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:32:00,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:32:00,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-04 00:32:00,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-04 00:32:00,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:00,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:00,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:32:00,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:32:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2609 proven. 105 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2025-03-04 00:32:01,056 INFO L312 TraceCheckSpWp]: Computing backward predicates...