./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.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 0187c0226e7b7468f7a0294cd8b2139ff70ed258b94c84a844f5927a4b55b158 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:34:52,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:34:52,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:34:52,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:34:52,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:34:52,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:34:52,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:34:52,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:34:52,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:34:52,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:34:52,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:34:52,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:34:52,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:34:52,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:34:52,578 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:34:52,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:34:52,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:34:52,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:34:52,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:34:52,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:34:52,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:34:52,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:34:52,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:34:52,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:34:52,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:34:52,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:34:52,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:34:52,580 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 -> 0187c0226e7b7468f7a0294cd8b2139ff70ed258b94c84a844f5927a4b55b158 [2025-03-17 04:34:52,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:34:52,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:34:52,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:34:52,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:34:52,860 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:34:52,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.i [2025-03-17 04:34:54,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef8f1722/12e561959b3942f388ef4c0faa1286c9/FLAGf1795ed3c [2025-03-17 04:34:54,370 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:34:54,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.i [2025-03-17 04:34:54,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef8f1722/12e561959b3942f388ef4c0faa1286c9/FLAGf1795ed3c [2025-03-17 04:34:54,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ef8f1722/12e561959b3942f388ef4c0faa1286c9 [2025-03-17 04:34:54,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:34:54,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:34:54,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:34:54,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:34:54,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:34:54,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c277aa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54, skipping insertion in model container [2025-03-17 04:34:54,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:34:54,566 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.i[916,929] [2025-03-17 04:34:54,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:34:54,715 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:34:54,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-92.i[916,929] [2025-03-17 04:34:54,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:34:54,784 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:34:54,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54 WrapperNode [2025-03-17 04:34:54,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:34:54,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:34:54,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:34:54,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:34:54,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,862 INFO L138 Inliner]: procedures = 26, calls = 59, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-17 04:34:54,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:34:54,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:34:54,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:34:54,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:34:54,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,917 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:34:54,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:34:54,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:34:54,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:34:54,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:34:54,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (1/1) ... [2025-03-17 04:34:54,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:34:54,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:34:54,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:34:54,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:34:55,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:34:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:34:55,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:34:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:34:55,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:34:55,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:34:55,118 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:34:55,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:34:55,881 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L365: havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short42#1;havoc property_#t~bitwise43#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1; [2025-03-17 04:34:55,962 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-03-17 04:34:55,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:34:56,009 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:34:56,010 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-17 04:34:56,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:34:56 BoogieIcfgContainer [2025-03-17 04:34:56,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:34:56,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:34:56,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:34:56,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:34:56,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:34:54" (1/3) ... [2025-03-17 04:34:56,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a528b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:34:56, skipping insertion in model container [2025-03-17 04:34:56,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:54" (2/3) ... [2025-03-17 04:34:56,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a528b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:34:56, skipping insertion in model container [2025-03-17 04:34:56,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:34:56" (3/3) ... [2025-03-17 04:34:56,019 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-92.i [2025-03-17 04:34:56,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:34:56,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-92.i that has 2 procedures, 193 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:34:56,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:34:56,095 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;@931947a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:34:56,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:34:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 144 states have (on average 1.5) internal successors, (216), 145 states have internal predecessors, (216), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 04:34:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-17 04:34:56,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:56,121 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:34:56,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:56,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2035523623, now seen corresponding path program 1 times [2025-03-17 04:34:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168279239] [2025-03-17 04:34:56,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:56,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 04:34:56,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 04:34:56,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:56,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-17 04:34:56,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:56,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168279239] [2025-03-17 04:34:56,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168279239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:34:56,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638887497] [2025-03-17 04:34:56,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:56,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:34:56,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:34:56,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:34:56,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:34:56,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 04:34:56,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 04:34:56,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:56,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:56,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:34:56,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:34:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2025-03-17 04:34:56,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:34:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638887497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:56,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:34:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:34:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032488145] [2025-03-17 04:34:56,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:56,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:34:56,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:56,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:34:56,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:34:56,923 INFO L87 Difference]: Start difference. First operand has 193 states, 144 states have (on average 1.5) internal successors, (216), 145 states have internal predecessors, (216), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-17 04:34:56,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:56,986 INFO L93 Difference]: Finished difference Result 383 states and 660 transitions. [2025-03-17 04:34:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:34:56,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) Word has length 315 [2025-03-17 04:34:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:56,998 INFO L225 Difference]: With dead ends: 383 [2025-03-17 04:34:56,999 INFO L226 Difference]: Without dead ends: 191 [2025-03-17 04:34:57,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:34:57,006 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:57,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:34:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-17 04:34:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-03-17 04:34:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 04:34:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 304 transitions. [2025-03-17 04:34:57,072 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 304 transitions. Word has length 315 [2025-03-17 04:34:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:57,072 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 304 transitions. [2025-03-17 04:34:57,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-17 04:34:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 304 transitions. [2025-03-17 04:34:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-17 04:34:57,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:57,081 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:34:57,090 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-17 04:34:57,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:34:57,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:57,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash 195894913, now seen corresponding path program 1 times [2025-03-17 04:34:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451947080] [2025-03-17 04:34:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:57,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 04:34:57,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 04:34:57,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:57,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:34:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:57,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451947080] [2025-03-17 04:34:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451947080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:34:57,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064433735] [2025-03-17 04:34:57,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:57,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:34:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:34:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:57,644 INFO L87 Difference]: Start difference. First operand 191 states and 304 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:57,746 INFO L93 Difference]: Finished difference Result 567 states and 902 transitions. [2025-03-17 04:34:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:34:57,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 315 [2025-03-17 04:34:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:57,754 INFO L225 Difference]: With dead ends: 567 [2025-03-17 04:34:57,754 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 04:34:57,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:57,758 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 292 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:57,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 752 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:34:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 04:34:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 208. [2025-03-17 04:34:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.49375) internal successors, (239), 160 states have internal predecessors, (239), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 04:34:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 331 transitions. [2025-03-17 04:34:57,783 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 331 transitions. Word has length 315 [2025-03-17 04:34:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:57,788 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 331 transitions. [2025-03-17 04:34:57,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 331 transitions. [2025-03-17 04:34:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-17 04:34:57,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:57,794 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:34:57,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:34:57,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 906015329, now seen corresponding path program 1 times [2025-03-17 04:34:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:57,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691897334] [2025-03-17 04:34:57,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:57,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 04:34:57,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 04:34:57,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:57,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:34:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691897334] [2025-03-17 04:34:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691897334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:58,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:58,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:34:58,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022993637] [2025-03-17 04:34:58,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:58,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:34:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:58,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:34:58,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:58,115 INFO L87 Difference]: Start difference. First operand 208 states and 331 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:58,204 INFO L93 Difference]: Finished difference Result 584 states and 926 transitions. [2025-03-17 04:34:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:34:58,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 315 [2025-03-17 04:34:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:58,208 INFO L225 Difference]: With dead ends: 584 [2025-03-17 04:34:58,208 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 04:34:58,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:58,209 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 281 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:58,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 566 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:34:58,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 04:34:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 208. [2025-03-17 04:34:58,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.475) internal successors, (236), 160 states have internal predecessors, (236), 46 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 04:34:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 328 transitions. [2025-03-17 04:34:58,230 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 328 transitions. Word has length 315 [2025-03-17 04:34:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:58,230 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 328 transitions. [2025-03-17 04:34:58,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 328 transitions. [2025-03-17 04:34:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-17 04:34:58,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:58,235 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:34:58,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:34:58,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:58,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1077583746, now seen corresponding path program 1 times [2025-03-17 04:34:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:58,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177010733] [2025-03-17 04:34:58,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:58,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 04:34:58,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 04:34:58,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:58,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:34:58,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:58,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177010733] [2025-03-17 04:34:58,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177010733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:58,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:58,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:34:58,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411979151] [2025-03-17 04:34:58,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:58,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:34:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:58,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:34:58,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:58,468 INFO L87 Difference]: Start difference. First operand 208 states and 328 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:58,555 INFO L93 Difference]: Finished difference Result 536 states and 841 transitions. [2025-03-17 04:34:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:34:58,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 315 [2025-03-17 04:34:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:58,562 INFO L225 Difference]: With dead ends: 536 [2025-03-17 04:34:58,562 INFO L226 Difference]: Without dead ends: 329 [2025-03-17 04:34:58,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:58,565 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 132 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:58,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 638 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:34:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-17 04:34:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2025-03-17 04:34:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 273 states have (on average 1.5018315018315018) internal successors, (410), 274 states have internal predecessors, (410), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 04:34:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 510 transitions. [2025-03-17 04:34:58,592 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 510 transitions. Word has length 315 [2025-03-17 04:34:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:58,593 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 510 transitions. [2025-03-17 04:34:58,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 510 transitions. [2025-03-17 04:34:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-17 04:34:58,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:58,599 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:34:58,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:34:58,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:58,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1724329672, now seen corresponding path program 1 times [2025-03-17 04:34:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301581546] [2025-03-17 04:34:58,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:58,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-17 04:34:58,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-17 04:34:58,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:58,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:34:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301581546] [2025-03-17 04:34:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301581546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:59,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:59,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:34:59,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047275619] [2025-03-17 04:34:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:59,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:34:59,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:59,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:34:59,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:34:59,078 INFO L87 Difference]: Start difference. First operand 326 states and 510 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:59,365 INFO L93 Difference]: Finished difference Result 968 states and 1517 transitions. [2025-03-17 04:34:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:34:59,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 316 [2025-03-17 04:34:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:59,373 INFO L225 Difference]: With dead ends: 968 [2025-03-17 04:34:59,375 INFO L226 Difference]: Without dead ends: 643 [2025-03-17 04:34:59,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:34:59,376 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 258 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:59,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 841 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:34:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-03-17 04:34:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 621. [2025-03-17 04:34:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 521 states have (on average 1.5086372360844529) internal successors, (786), 522 states have internal predecessors, (786), 96 states have call successors, (96), 3 states have call predecessors, (96), 3 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 04:34:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 978 transitions. [2025-03-17 04:34:59,412 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 978 transitions. Word has length 316 [2025-03-17 04:34:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:59,413 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 978 transitions. [2025-03-17 04:34:59,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 978 transitions. [2025-03-17 04:34:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-17 04:34:59,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:59,416 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:34:59,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:34:59,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:59,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash 72738221, now seen corresponding path program 1 times [2025-03-17 04:34:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:59,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378065987] [2025-03-17 04:34:59,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:59,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:59,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-17 04:34:59,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-17 04:34:59,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:59,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:34:59,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378065987] [2025-03-17 04:34:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378065987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:59,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:59,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:34:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582180959] [2025-03-17 04:34:59,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:59,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:34:59,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:59,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:34:59,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:34:59,689 INFO L87 Difference]: Start difference. First operand 621 states and 978 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:34:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:59,965 INFO L93 Difference]: Finished difference Result 1629 states and 2543 transitions. [2025-03-17 04:34:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:34:59,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 317 [2025-03-17 04:34:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:59,972 INFO L225 Difference]: With dead ends: 1629 [2025-03-17 04:34:59,972 INFO L226 Difference]: Without dead ends: 1092 [2025-03-17 04:34:59,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:34:59,974 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 386 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:59,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 896 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:34:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2025-03-17 04:35:00,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1070. [2025-03-17 04:35:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 918 states have (on average 1.4967320261437909) internal successors, (1374), 920 states have internal predecessors, (1374), 146 states have call successors, (146), 5 states have call predecessors, (146), 5 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-17 04:35:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1666 transitions. [2025-03-17 04:35:00,041 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1666 transitions. Word has length 317 [2025-03-17 04:35:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:00,041 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1666 transitions. [2025-03-17 04:35:00,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1666 transitions. [2025-03-17 04:35:00,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-17 04:35:00,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:00,045 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:00,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:35:00,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:00,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1293311819, now seen corresponding path program 1 times [2025-03-17 04:35:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:00,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109797634] [2025-03-17 04:35:00,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:00,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-17 04:35:00,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-17 04:35:00,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:00,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109797634] [2025-03-17 04:35:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109797634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:00,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:00,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:00,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083766557] [2025-03-17 04:35:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:00,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:00,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:00,529 INFO L87 Difference]: Start difference. First operand 1070 states and 1666 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:00,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:00,842 INFO L93 Difference]: Finished difference Result 2098 states and 3251 transitions. [2025-03-17 04:35:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 318 [2025-03-17 04:35:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:00,848 INFO L225 Difference]: With dead ends: 2098 [2025-03-17 04:35:00,849 INFO L226 Difference]: Without dead ends: 1112 [2025-03-17 04:35:00,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:00,852 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 250 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:00,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 839 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-17 04:35:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1078. [2025-03-17 04:35:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 926 states have (on average 1.4913606911447084) internal successors, (1381), 928 states have internal predecessors, (1381), 146 states have call successors, (146), 5 states have call predecessors, (146), 5 states have return successors, (146), 144 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-17 04:35:00,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1673 transitions. [2025-03-17 04:35:00,928 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1673 transitions. Word has length 318 [2025-03-17 04:35:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:00,929 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1673 transitions. [2025-03-17 04:35:00,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1673 transitions. [2025-03-17 04:35:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-17 04:35:00,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:00,938 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:00,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:35:00,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:00,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1891656526, now seen corresponding path program 1 times [2025-03-17 04:35:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105315106] [2025-03-17 04:35:00,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:00,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-17 04:35:01,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-17 04:35:01,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:01,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105315106] [2025-03-17 04:35:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105315106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:01,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:01,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:01,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15406454] [2025-03-17 04:35:01,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:01,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:01,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:01,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:01,400 INFO L87 Difference]: Start difference. First operand 1078 states and 1673 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:01,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:01,586 INFO L93 Difference]: Finished difference Result 2296 states and 3531 transitions. [2025-03-17 04:35:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 319 [2025-03-17 04:35:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:01,593 INFO L225 Difference]: With dead ends: 2296 [2025-03-17 04:35:01,593 INFO L226 Difference]: Without dead ends: 1383 [2025-03-17 04:35:01,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:01,595 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 244 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:01,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1021 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:35:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-17 04:35:01,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 919. [2025-03-17 04:35:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 774 states have (on average 1.4948320413436693) internal successors, (1157), 774 states have internal predecessors, (1157), 138 states have call successors, (138), 6 states have call predecessors, (138), 6 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-17 04:35:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1433 transitions. [2025-03-17 04:35:01,659 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1433 transitions. Word has length 319 [2025-03-17 04:35:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:01,659 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1433 transitions. [2025-03-17 04:35:01,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1433 transitions. [2025-03-17 04:35:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-17 04:35:01,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:01,662 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:01,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:35:01,662 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:01,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash -185552817, now seen corresponding path program 1 times [2025-03-17 04:35:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:01,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467443759] [2025-03-17 04:35:01,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:01,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-17 04:35:01,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-17 04:35:01,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:01,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467443759] [2025-03-17 04:35:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467443759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:02,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474855069] [2025-03-17 04:35:02,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:02,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:02,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:02,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:02,391 INFO L87 Difference]: Start difference. First operand 919 states and 1433 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:02,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:02,600 INFO L93 Difference]: Finished difference Result 2368 states and 3703 transitions. [2025-03-17 04:35:02,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:02,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 319 [2025-03-17 04:35:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:02,608 INFO L225 Difference]: With dead ends: 2368 [2025-03-17 04:35:02,609 INFO L226 Difference]: Without dead ends: 1670 [2025-03-17 04:35:02,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:02,611 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 182 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:02,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 760 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-03-17 04:35:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1660. [2025-03-17 04:35:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1419 states have (on average 1.4918957011980267) internal successors, (2117), 1419 states have internal predecessors, (2117), 230 states have call successors, (230), 10 states have call predecessors, (230), 10 states have return successors, (230), 230 states have call predecessors, (230), 230 states have call successors, (230) [2025-03-17 04:35:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2577 transitions. [2025-03-17 04:35:02,691 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2577 transitions. Word has length 319 [2025-03-17 04:35:02,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:02,692 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2577 transitions. [2025-03-17 04:35:02,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2577 transitions. [2025-03-17 04:35:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-17 04:35:02,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:02,695 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:02,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:35:02,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:02,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash -594377042, now seen corresponding path program 1 times [2025-03-17 04:35:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:02,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812321045] [2025-03-17 04:35:02,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:02,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:02,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-17 04:35:02,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-17 04:35:02,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:02,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:03,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812321045] [2025-03-17 04:35:03,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812321045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:03,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:03,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:03,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119830747] [2025-03-17 04:35:03,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:03,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:03,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:03,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:03,091 INFO L87 Difference]: Start difference. First operand 1660 states and 2577 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:03,358 INFO L93 Difference]: Finished difference Result 3232 states and 5004 transitions. [2025-03-17 04:35:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:03,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 319 [2025-03-17 04:35:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:03,367 INFO L225 Difference]: With dead ends: 3232 [2025-03-17 04:35:03,367 INFO L226 Difference]: Without dead ends: 1694 [2025-03-17 04:35:03,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:03,372 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 260 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:03,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 849 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-03-17 04:35:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1660. [2025-03-17 04:35:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1419 states have (on average 1.4869626497533475) internal successors, (2110), 1419 states have internal predecessors, (2110), 230 states have call successors, (230), 10 states have call predecessors, (230), 10 states have return successors, (230), 230 states have call predecessors, (230), 230 states have call successors, (230) [2025-03-17 04:35:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2570 transitions. [2025-03-17 04:35:03,451 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2570 transitions. Word has length 319 [2025-03-17 04:35:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:03,452 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2570 transitions. [2025-03-17 04:35:03,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2570 transitions. [2025-03-17 04:35:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-17 04:35:03,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:03,455 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:03,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:35:03,455 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:03,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash -542253265, now seen corresponding path program 1 times [2025-03-17 04:35:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648232841] [2025-03-17 04:35:03,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:03,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-17 04:35:03,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-17 04:35:03,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648232841] [2025-03-17 04:35:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648232841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:06,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 04:35:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285240478] [2025-03-17 04:35:06,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:06,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 04:35:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:06,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 04:35:06,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-17 04:35:06,045 INFO L87 Difference]: Start difference. First operand 1660 states and 2570 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 15 states have internal predecessors, (93), 3 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-03-17 04:35:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:12,582 INFO L93 Difference]: Finished difference Result 14906 states and 22863 transitions. [2025-03-17 04:35:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 04:35:12,582 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 15 states have internal predecessors, (93), 3 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 320 [2025-03-17 04:35:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:12,631 INFO L225 Difference]: With dead ends: 14906 [2025-03-17 04:35:12,631 INFO L226 Difference]: Without dead ends: 14212 [2025-03-17 04:35:12,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=574, Invalid=1682, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 04:35:12,661 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 3585 mSDsluCounter, 3300 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3585 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:12,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3585 Valid, 3744 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 04:35:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14212 states. [2025-03-17 04:35:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14212 to 7383. [2025-03-17 04:35:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 6845 states have (on average 1.5323593864134404) internal successors, (10489), 6857 states have internal predecessors, (10489), 494 states have call successors, (494), 43 states have call predecessors, (494), 43 states have return successors, (494), 482 states have call predecessors, (494), 494 states have call successors, (494) [2025-03-17 04:35:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 11477 transitions. [2025-03-17 04:35:12,943 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 11477 transitions. Word has length 320 [2025-03-17 04:35:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:12,943 INFO L471 AbstractCegarLoop]: Abstraction has 7383 states and 11477 transitions. [2025-03-17 04:35:12,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 15 states have internal predecessors, (93), 3 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-03-17 04:35:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 11477 transitions. [2025-03-17 04:35:12,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-17 04:35:12,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:12,949 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:12,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:35:12,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:12,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1569037104, now seen corresponding path program 1 times [2025-03-17 04:35:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870553606] [2025-03-17 04:35:12,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:12,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-17 04:35:13,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-17 04:35:13,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:13,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:13,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870553606] [2025-03-17 04:35:13,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870553606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:13,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018624135] [2025-03-17 04:35:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:13,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:13,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:13,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:13,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:13,394 INFO L87 Difference]: Start difference. First operand 7383 states and 11477 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:13,565 INFO L93 Difference]: Finished difference Result 11858 states and 18356 transitions. [2025-03-17 04:35:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 320 [2025-03-17 04:35:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:13,591 INFO L225 Difference]: With dead ends: 11858 [2025-03-17 04:35:13,591 INFO L226 Difference]: Without dead ends: 8712 [2025-03-17 04:35:13,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:13,600 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 181 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:13,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 856 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:35:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8712 states. [2025-03-17 04:35:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8712 to 7752. [2025-03-17 04:35:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7752 states, 7022 states have (on average 1.502848191398462) internal successors, (10553), 7034 states have internal predecessors, (10553), 678 states have call successors, (678), 51 states have call predecessors, (678), 51 states have return successors, (678), 666 states have call predecessors, (678), 678 states have call successors, (678) [2025-03-17 04:35:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7752 states to 7752 states and 11909 transitions. [2025-03-17 04:35:13,917 INFO L78 Accepts]: Start accepts. Automaton has 7752 states and 11909 transitions. Word has length 320 [2025-03-17 04:35:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:13,918 INFO L471 AbstractCegarLoop]: Abstraction has 7752 states and 11909 transitions. [2025-03-17 04:35:13,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7752 states and 11909 transitions. [2025-03-17 04:35:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-17 04:35:13,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:13,922 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:13,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:35:13,922 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:13,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1475862109, now seen corresponding path program 1 times [2025-03-17 04:35:13,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:13,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357517648] [2025-03-17 04:35:13,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:13,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:13,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-17 04:35:14,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-17 04:35:14,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:14,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:14,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357517648] [2025-03-17 04:35:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357517648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:14,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70568439] [2025-03-17 04:35:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:14,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:14,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:14,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:14,268 INFO L87 Difference]: Start difference. First operand 7752 states and 11909 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:14,558 INFO L93 Difference]: Finished difference Result 11691 states and 17892 transitions. [2025-03-17 04:35:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:14,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 321 [2025-03-17 04:35:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:14,585 INFO L225 Difference]: With dead ends: 11691 [2025-03-17 04:35:14,585 INFO L226 Difference]: Without dead ends: 5245 [2025-03-17 04:35:14,601 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-17 04:35:14,603 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 80 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:14,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 772 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5245 states. [2025-03-17 04:35:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5245 to 4007. [2025-03-17 04:35:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 3513 states have (on average 1.4733845715912326) internal successors, (5176), 3519 states have internal predecessors, (5176), 458 states have call successors, (458), 35 states have call predecessors, (458), 35 states have return successors, (458), 452 states have call predecessors, (458), 458 states have call successors, (458) [2025-03-17 04:35:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 6092 transitions. [2025-03-17 04:35:14,805 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 6092 transitions. Word has length 321 [2025-03-17 04:35:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:14,805 INFO L471 AbstractCegarLoop]: Abstraction has 4007 states and 6092 transitions. [2025-03-17 04:35:14,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 6092 transitions. [2025-03-17 04:35:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-17 04:35:14,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:14,809 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:14,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:35:14,809 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:14,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:14,810 INFO L85 PathProgramCache]: Analyzing trace with hash 31689700, now seen corresponding path program 1 times [2025-03-17 04:35:14,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:14,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848673104] [2025-03-17 04:35:14,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:14,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-17 04:35:14,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-17 04:35:14,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:14,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:18,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:18,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848673104] [2025-03-17 04:35:18,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848673104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:18,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:18,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:35:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093182478] [2025-03-17 04:35:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:18,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:35:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:18,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:35:18,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:35:18,857 INFO L87 Difference]: Start difference. First operand 4007 states and 6092 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:19,558 INFO L93 Difference]: Finished difference Result 11260 states and 16574 transitions. [2025-03-17 04:35:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:35:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 321 [2025-03-17 04:35:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:19,575 INFO L225 Difference]: With dead ends: 11260 [2025-03-17 04:35:19,575 INFO L226 Difference]: Without dead ends: 7908 [2025-03-17 04:35:19,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:35:19,581 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 532 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:19,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1556 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:35:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7908 states. [2025-03-17 04:35:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7908 to 4304. [2025-03-17 04:35:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4304 states, 3810 states have (on average 1.4601049868766405) internal successors, (5563), 3816 states have internal predecessors, (5563), 458 states have call successors, (458), 35 states have call predecessors, (458), 35 states have return successors, (458), 452 states have call predecessors, (458), 458 states have call successors, (458) [2025-03-17 04:35:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4304 states to 4304 states and 6479 transitions. [2025-03-17 04:35:19,744 INFO L78 Accepts]: Start accepts. Automaton has 4304 states and 6479 transitions. Word has length 321 [2025-03-17 04:35:19,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:19,744 INFO L471 AbstractCegarLoop]: Abstraction has 4304 states and 6479 transitions. [2025-03-17 04:35:19,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:19,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4304 states and 6479 transitions. [2025-03-17 04:35:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-17 04:35:19,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:19,747 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:19,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:35:19,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:19,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash 105105414, now seen corresponding path program 1 times [2025-03-17 04:35:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:19,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527476407] [2025-03-17 04:35:19,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:19,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-17 04:35:19,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-17 04:35:19,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:19,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:19,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527476407] [2025-03-17 04:35:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527476407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:19,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:35:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080464496] [2025-03-17 04:35:19,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:19,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:35:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:19,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:35:19,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:35:19,987 INFO L87 Difference]: Start difference. First operand 4304 states and 6479 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:20,319 INFO L93 Difference]: Finished difference Result 10930 states and 16318 transitions. [2025-03-17 04:35:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:35:20,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 321 [2025-03-17 04:35:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:20,350 INFO L225 Difference]: With dead ends: 10930 [2025-03-17 04:35:20,350 INFO L226 Difference]: Without dead ends: 7365 [2025-03-17 04:35:20,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:35:20,356 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 268 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:20,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 708 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:35:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2025-03-17 04:35:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 4332. [2025-03-17 04:35:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4332 states, 3838 states have (on average 1.4567483064095883) internal successors, (5591), 3844 states have internal predecessors, (5591), 458 states have call successors, (458), 35 states have call predecessors, (458), 35 states have return successors, (458), 452 states have call predecessors, (458), 458 states have call successors, (458) [2025-03-17 04:35:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4332 states to 4332 states and 6507 transitions. [2025-03-17 04:35:20,601 INFO L78 Accepts]: Start accepts. Automaton has 4332 states and 6507 transitions. Word has length 321 [2025-03-17 04:35:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:20,602 INFO L471 AbstractCegarLoop]: Abstraction has 4332 states and 6507 transitions. [2025-03-17 04:35:20,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 6507 transitions. [2025-03-17 04:35:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-17 04:35:20,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:20,605 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:20,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 04:35:20,606 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:20,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1066719431, now seen corresponding path program 1 times [2025-03-17 04:35:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735108966] [2025-03-17 04:35:20,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:20,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-03-17 04:35:20,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-03-17 04:35:20,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:20,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:24,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735108966] [2025-03-17 04:35:24,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735108966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:24,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:24,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:35:24,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514791227] [2025-03-17 04:35:24,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:24,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:35:24,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:24,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:35:24,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:35:24,926 INFO L87 Difference]: Start difference. First operand 4332 states and 6507 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:25,737 INFO L93 Difference]: Finished difference Result 11803 states and 17309 transitions. [2025-03-17 04:35:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:35:25,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 321 [2025-03-17 04:35:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:25,770 INFO L225 Difference]: With dead ends: 11803 [2025-03-17 04:35:25,770 INFO L226 Difference]: Without dead ends: 8338 [2025-03-17 04:35:25,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:35:25,778 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 553 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:25,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1832 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:35:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8338 states. [2025-03-17 04:35:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8338 to 5660. [2025-03-17 04:35:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5660 states, 5124 states have (on average 1.4414519906323184) internal successors, (7386), 5144 states have internal predecessors, (7386), 486 states have call successors, (486), 49 states have call predecessors, (486), 49 states have return successors, (486), 466 states have call predecessors, (486), 486 states have call successors, (486) [2025-03-17 04:35:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5660 states to 5660 states and 8358 transitions. [2025-03-17 04:35:26,154 INFO L78 Accepts]: Start accepts. Automaton has 5660 states and 8358 transitions. Word has length 321 [2025-03-17 04:35:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:26,156 INFO L471 AbstractCegarLoop]: Abstraction has 5660 states and 8358 transitions. [2025-03-17 04:35:26,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5660 states and 8358 transitions. [2025-03-17 04:35:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:35:26,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:26,175 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:26,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 04:35:26,177 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1463929308, now seen corresponding path program 1 times [2025-03-17 04:35:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:26,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037209021] [2025-03-17 04:35:26,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:26,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:35:26,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:35:26,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:26,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037209021] [2025-03-17 04:35:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037209021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:27,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:35:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672750440] [2025-03-17 04:35:27,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:35:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:27,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:35:27,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:27,635 INFO L87 Difference]: Start difference. First operand 5660 states and 8358 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:28,109 INFO L93 Difference]: Finished difference Result 13444 states and 19652 transitions. [2025-03-17 04:35:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:35:28,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 322 [2025-03-17 04:35:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:28,128 INFO L225 Difference]: With dead ends: 13444 [2025-03-17 04:35:28,128 INFO L226 Difference]: Without dead ends: 8706 [2025-03-17 04:35:28,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:35:28,138 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 420 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:28,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 994 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states. [2025-03-17 04:35:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 4670. [2025-03-17 04:35:28,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4670 states, 4161 states have (on average 1.445806296563326) internal successors, (6016), 4167 states have internal predecessors, (6016), 458 states have call successors, (458), 50 states have call predecessors, (458), 50 states have return successors, (458), 452 states have call predecessors, (458), 458 states have call successors, (458) [2025-03-17 04:35:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 6932 transitions. [2025-03-17 04:35:28,450 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 6932 transitions. Word has length 322 [2025-03-17 04:35:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:28,451 INFO L471 AbstractCegarLoop]: Abstraction has 4670 states and 6932 transitions. [2025-03-17 04:35:28,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 6932 transitions. [2025-03-17 04:35:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:35:28,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:28,458 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:28,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 04:35:28,459 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:28,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:28,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1432909501, now seen corresponding path program 1 times [2025-03-17 04:35:28,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:28,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911239426] [2025-03-17 04:35:28,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:28,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:28,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:35:28,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:35:28,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:28,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:33,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911239426] [2025-03-17 04:35:33,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911239426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:33,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:33,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:35:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662262435] [2025-03-17 04:35:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:33,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:35:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:33,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:35:33,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:35:33,396 INFO L87 Difference]: Start difference. First operand 4670 states and 6932 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:34,698 INFO L93 Difference]: Finished difference Result 11093 states and 16364 transitions. [2025-03-17 04:35:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:35:34,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 322 [2025-03-17 04:35:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:34,719 INFO L225 Difference]: With dead ends: 11093 [2025-03-17 04:35:34,720 INFO L226 Difference]: Without dead ends: 7345 [2025-03-17 04:35:34,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:35:34,729 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 535 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:34,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2094 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 04:35:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7345 states. [2025-03-17 04:35:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 6935. [2025-03-17 04:35:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 5960 states have (on average 1.4104026845637583) internal successors, (8406), 5980 states have internal predecessors, (8406), 870 states have call successors, (870), 104 states have call predecessors, (870), 104 states have return successors, (870), 850 states have call predecessors, (870), 870 states have call successors, (870) [2025-03-17 04:35:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 10146 transitions. [2025-03-17 04:35:35,139 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 10146 transitions. Word has length 322 [2025-03-17 04:35:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:35,142 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 10146 transitions. [2025-03-17 04:35:35,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 10146 transitions. [2025-03-17 04:35:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:35:35,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:35,148 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:35,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 04:35:35,149 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:35,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1188752006, now seen corresponding path program 1 times [2025-03-17 04:35:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:35,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448337078] [2025-03-17 04:35:35,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:35,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:35:35,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:35:35,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:35,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:35,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448337078] [2025-03-17 04:35:35,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448337078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:35,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:35,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:35:35,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775150827] [2025-03-17 04:35:35,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:35,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:35:35,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:35,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:35:35,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:35:35,830 INFO L87 Difference]: Start difference. First operand 6935 states and 10146 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-17 04:35:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:37,531 INFO L93 Difference]: Finished difference Result 23241 states and 33561 transitions. [2025-03-17 04:35:37,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:35:37,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 322 [2025-03-17 04:35:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:37,577 INFO L225 Difference]: With dead ends: 23241 [2025-03-17 04:35:37,577 INFO L226 Difference]: Without dead ends: 17561 [2025-03-17 04:35:37,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:35:37,592 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 846 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:37,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1325 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:35:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17561 states. [2025-03-17 04:35:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17561 to 14147. [2025-03-17 04:35:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14147 states, 12403 states have (on average 1.4124808514069176) internal successors, (17519), 12459 states have internal predecessors, (17519), 1510 states have call successors, (1510), 233 states have call predecessors, (1510), 233 states have return successors, (1510), 1454 states have call predecessors, (1510), 1510 states have call successors, (1510) [2025-03-17 04:35:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14147 states to 14147 states and 20539 transitions. [2025-03-17 04:35:38,454 INFO L78 Accepts]: Start accepts. Automaton has 14147 states and 20539 transitions. Word has length 322 [2025-03-17 04:35:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:38,455 INFO L471 AbstractCegarLoop]: Abstraction has 14147 states and 20539 transitions. [2025-03-17 04:35:38,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 2 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-17 04:35:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 14147 states and 20539 transitions. [2025-03-17 04:35:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:35:38,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:38,460 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:38,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 04:35:38,461 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:38,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:38,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1881853703, now seen corresponding path program 1 times [2025-03-17 04:35:38,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:38,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819919606] [2025-03-17 04:35:38,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:38,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:35:38,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:35:38,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:38,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:38,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:38,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819919606] [2025-03-17 04:35:38,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819919606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:38,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:38,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:38,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106226644] [2025-03-17 04:35:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:38,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:38,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:38,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:38,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:38,903 INFO L87 Difference]: Start difference. First operand 14147 states and 20539 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:40,299 INFO L93 Difference]: Finished difference Result 34686 states and 49481 transitions. [2025-03-17 04:35:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:40,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 322 [2025-03-17 04:35:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:40,361 INFO L225 Difference]: With dead ends: 34686 [2025-03-17 04:35:40,362 INFO L226 Difference]: Without dead ends: 22850 [2025-03-17 04:35:40,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:40,386 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 255 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:40,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 610 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22850 states. [2025-03-17 04:35:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22850 to 12113. [2025-03-17 04:35:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12113 states, 10381 states have (on average 1.3935073692322513) internal successors, (14466), 10429 states have internal predecessors, (14466), 1462 states have call successors, (1462), 269 states have call predecessors, (1462), 269 states have return successors, (1462), 1414 states have call predecessors, (1462), 1462 states have call successors, (1462) [2025-03-17 04:35:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 17390 transitions. [2025-03-17 04:35:41,483 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 17390 transitions. Word has length 322 [2025-03-17 04:35:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:41,484 INFO L471 AbstractCegarLoop]: Abstraction has 12113 states and 17390 transitions. [2025-03-17 04:35:41,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 17390 transitions. [2025-03-17 04:35:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-17 04:35:41,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:41,488 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:41,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 04:35:41,488 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:41,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1155915035, now seen corresponding path program 1 times [2025-03-17 04:35:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:41,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037459558] [2025-03-17 04:35:41,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:41,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-17 04:35:41,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-17 04:35:41,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:41,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037459558] [2025-03-17 04:35:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037459558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:35:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967103917] [2025-03-17 04:35:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:45,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:35:45,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:45,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:35:45,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:35:45,807 INFO L87 Difference]: Start difference. First operand 12113 states and 17390 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:47,274 INFO L93 Difference]: Finished difference Result 28219 states and 40059 transitions. [2025-03-17 04:35:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:35:47,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 322 [2025-03-17 04:35:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:47,325 INFO L225 Difference]: With dead ends: 28219 [2025-03-17 04:35:47,325 INFO L226 Difference]: Without dead ends: 17956 [2025-03-17 04:35:47,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:35:47,350 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 560 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:47,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 2275 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:35:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17956 states. [2025-03-17 04:35:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17956 to 11938. [2025-03-17 04:35:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11938 states, 10206 states have (on average 1.389280815206741) internal successors, (14179), 10254 states have internal predecessors, (14179), 1462 states have call successors, (1462), 269 states have call predecessors, (1462), 269 states have return successors, (1462), 1414 states have call predecessors, (1462), 1462 states have call successors, (1462) [2025-03-17 04:35:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11938 states to 11938 states and 17103 transitions. [2025-03-17 04:35:48,223 INFO L78 Accepts]: Start accepts. Automaton has 11938 states and 17103 transitions. Word has length 322 [2025-03-17 04:35:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:48,223 INFO L471 AbstractCegarLoop]: Abstraction has 11938 states and 17103 transitions. [2025-03-17 04:35:48,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 11938 states and 17103 transitions. [2025-03-17 04:35:48,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-17 04:35:48,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:48,227 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:48,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 04:35:48,227 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:48,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:48,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1899810657, now seen corresponding path program 1 times [2025-03-17 04:35:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857928886] [2025-03-17 04:35:48,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:48,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-17 04:35:48,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-17 04:35:48,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:48,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:48,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:48,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857928886] [2025-03-17 04:35:48,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857928886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:48,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:48,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:35:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347692722] [2025-03-17 04:35:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:48,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:35:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:48,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:35:48,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:35:48,552 INFO L87 Difference]: Start difference. First operand 11938 states and 17103 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:50,184 INFO L93 Difference]: Finished difference Result 43995 states and 63425 transitions. [2025-03-17 04:35:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 04:35:50,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 323 [2025-03-17 04:35:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:50,250 INFO L225 Difference]: With dead ends: 43995 [2025-03-17 04:35:50,250 INFO L226 Difference]: Without dead ends: 32186 [2025-03-17 04:35:50,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:35:50,275 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 688 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:50,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1850 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32186 states. [2025-03-17 04:35:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32186 to 17177. [2025-03-17 04:35:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17177 states, 15445 states have (on average 1.4089996762706378) internal successors, (21762), 15493 states have internal predecessors, (21762), 1462 states have call successors, (1462), 269 states have call predecessors, (1462), 269 states have return successors, (1462), 1414 states have call predecessors, (1462), 1462 states have call successors, (1462) [2025-03-17 04:35:51,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17177 states to 17177 states and 24686 transitions. [2025-03-17 04:35:51,430 INFO L78 Accepts]: Start accepts. Automaton has 17177 states and 24686 transitions. Word has length 323 [2025-03-17 04:35:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:51,435 INFO L471 AbstractCegarLoop]: Abstraction has 17177 states and 24686 transitions. [2025-03-17 04:35:51,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 17177 states and 24686 transitions. [2025-03-17 04:35:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-17 04:35:51,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:51,442 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:51,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 04:35:51,442 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:51,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash -866080900, now seen corresponding path program 1 times [2025-03-17 04:35:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:51,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704522866] [2025-03-17 04:35:51,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:51,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-17 04:35:51,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-17 04:35:51,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:51,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-03-17 04:35:52,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704522866] [2025-03-17 04:35:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704522866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:35:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380779683] [2025-03-17 04:35:52,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:52,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:35:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:52,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:35:52,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:35:52,119 INFO L87 Difference]: Start difference. First operand 17177 states and 24686 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:54,463 INFO L93 Difference]: Finished difference Result 55709 states and 79086 transitions. [2025-03-17 04:35:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:35:54,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) Word has length 323 [2025-03-17 04:35:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:54,549 INFO L225 Difference]: With dead ends: 55709 [2025-03-17 04:35:54,549 INFO L226 Difference]: Without dead ends: 40558 [2025-03-17 04:35:54,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:35:54,582 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 419 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:54,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1247 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:35:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40558 states. [2025-03-17 04:35:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40558 to 33338. [2025-03-17 04:35:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33338 states, 30704 states have (on average 1.4120635747785304) internal successors, (43356), 30812 states have internal predecessors, (43356), 2110 states have call successors, (2110), 523 states have call predecessors, (2110), 523 states have return successors, (2110), 2002 states have call predecessors, (2110), 2110 states have call successors, (2110) [2025-03-17 04:35:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33338 states to 33338 states and 47576 transitions. [2025-03-17 04:35:56,384 INFO L78 Accepts]: Start accepts. Automaton has 33338 states and 47576 transitions. Word has length 323 [2025-03-17 04:35:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:56,384 INFO L471 AbstractCegarLoop]: Abstraction has 33338 states and 47576 transitions. [2025-03-17 04:35:56,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (46), 1 states have call predecessors, (46), 1 states have return successors, (46), 1 states have call predecessors, (46), 1 states have call successors, (46) [2025-03-17 04:35:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 33338 states and 47576 transitions. [2025-03-17 04:35:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-17 04:35:56,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:56,396 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:35:56,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 04:35:56,396 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:56,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1728145917, now seen corresponding path program 1 times [2025-03-17 04:35:56,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:56,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634797139] [2025-03-17 04:35:56,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:56,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-17 04:35:56,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-17 04:35:56,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:56,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat