./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-94.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 a92ccd1f56cdb28b8e6efc63e50fd814467549956882758cf5aa04b7a8a9eb25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:28:31,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:28:31,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:28:31,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:28:31,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:28:31,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:28:31,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:28:31,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:28:31,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:28:31,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:28:31,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:28:31,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:28:31,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:28:31,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:28:31,716 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:28:31,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:28:31,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:28:31,716 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:28:31,717 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:28:31,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:28:31,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:28:31,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:28:31,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:28:31,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:28:31,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:28:31,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:28:31,718 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 -> a92ccd1f56cdb28b8e6efc63e50fd814467549956882758cf5aa04b7a8a9eb25 [2025-03-08 15:28:31,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:28:31,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:28:31,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:28:31,959 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:28:31,959 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:28:31,960 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-94.i [2025-03-08 15:28:33,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f7e36ea/7e4d855583154050b9f6e5f9f56fd623/FLAGe394bca51 [2025-03-08 15:28:33,408 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:28:33,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-94.i [2025-03-08 15:28:33,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f7e36ea/7e4d855583154050b9f6e5f9f56fd623/FLAGe394bca51 [2025-03-08 15:28:33,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f7e36ea/7e4d855583154050b9f6e5f9f56fd623 [2025-03-08 15:28:33,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:28:33,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:28:33,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:28:33,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:28:33,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:28:33,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:33,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb3c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33, skipping insertion in model container [2025-03-08 15:28:33,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:33,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:28:33,801 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-94.i[916,929] [2025-03-08 15:28:33,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:28:33,906 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:28:33,914 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-94.i[916,929] [2025-03-08 15:28:33,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:28:33,974 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:28:33,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33 WrapperNode [2025-03-08 15:28:33,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:28:33,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:28:33,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:28:33,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:28:33,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:33,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,051 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2025-03-08 15:28:34,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:28:34,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:28:34,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:28:34,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:28:34,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,104 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-08 15:28:34,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:28:34,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:28:34,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:28:34,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:28:34,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (1/1) ... [2025-03-08 15:28:34,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:28:34,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:28:34,184 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-08 15:28:34,186 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-08 15:28:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:28:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:28:34,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:28:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:28:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:28:34,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:28:34,273 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:28:34,275 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:28:34,949 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~bitwise38#1;havoc property_#t~ite41#1;havoc property_#t~bitwise39#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; [2025-03-08 15:28:35,010 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-08 15:28:35,010 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:28:35,035 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:28:35,037 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:28:35,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:28:35 BoogieIcfgContainer [2025-03-08 15:28:35,037 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:28:35,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:28:35,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:28:35,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:28:35,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:28:33" (1/3) ... [2025-03-08 15:28:35,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4493205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:28:35, skipping insertion in model container [2025-03-08 15:28:35,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:28:33" (2/3) ... [2025-03-08 15:28:35,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4493205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:28:35, skipping insertion in model container [2025-03-08 15:28:35,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:28:35" (3/3) ... [2025-03-08 15:28:35,043 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-94.i [2025-03-08 15:28:35,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:28:35,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-94.i that has 2 procedures, 191 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:28:35,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:28:35,125 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;@18fc834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:28:35,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:28:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 149 states have (on average 1.5100671140939597) internal successors, (225), 150 states have internal predecessors, (225), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 15:28:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 15:28:35,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:35,141 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:35,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:35,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1584155935, now seen corresponding path program 1 times [2025-03-08 15:28:35,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:35,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195959570] [2025-03-08 15:28:35,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:35,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:35,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 15:28:35,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 15:28:35,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:35,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-03-08 15:28:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195959570] [2025-03-08 15:28:35,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195959570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:28:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017785272] [2025-03-08 15:28:35,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:28:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:28:35,486 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-08 15:28:35,488 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-08 15:28:35,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 15:28:35,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 15:28:35,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:35,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:35,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:28:35,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:28:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-03-08 15:28:35,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:28:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017785272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:35,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:28:35,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:28:35,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298422565] [2025-03-08 15:28:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:35,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:28:35,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:35,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:28:35,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:28:35,774 INFO L87 Difference]: Start difference. First operand has 191 states, 149 states have (on average 1.5100671140939597) internal successors, (225), 150 states have internal predecessors, (225), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 15:28:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:35,820 INFO L93 Difference]: Finished difference Result 376 states and 640 transitions. [2025-03-08 15:28:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:28:35,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 275 [2025-03-08 15:28:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:35,830 INFO L225 Difference]: With dead ends: 376 [2025-03-08 15:28:35,830 INFO L226 Difference]: Without dead ends: 188 [2025-03-08 15:28:35,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 276 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-08 15:28:35,834 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:35,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:28:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-08 15:28:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-08 15:28:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 147 states have (on average 1.4965986394557824) internal successors, (220), 147 states have internal predecessors, (220), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 15:28:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 298 transitions. [2025-03-08 15:28:35,879 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 298 transitions. Word has length 275 [2025-03-08 15:28:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:35,881 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 298 transitions. [2025-03-08 15:28:35,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 15:28:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 298 transitions. [2025-03-08 15:28:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 15:28:35,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:35,887 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:35,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:28:36,088 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-08 15:28:36,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:36,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:36,090 INFO L85 PathProgramCache]: Analyzing trace with hash -916361862, now seen corresponding path program 1 times [2025-03-08 15:28:36,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:36,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285062906] [2025-03-08 15:28:36,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:36,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:36,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 15:28:36,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 15:28:36,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:36,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285062906] [2025-03-08 15:28:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285062906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:37,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:37,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:28:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701557494] [2025-03-08 15:28:37,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:37,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:28:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:37,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:28:37,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:28:37,081 INFO L87 Difference]: Start difference. First operand 188 states and 298 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:38,282 INFO L93 Difference]: Finished difference Result 847 states and 1338 transitions. [2025-03-08 15:28:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:28:38,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 275 [2025-03-08 15:28:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:38,290 INFO L225 Difference]: With dead ends: 847 [2025-03-08 15:28:38,290 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 15:28:38,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:28:38,292 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 672 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:38,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 2439 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:28:38,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 15:28:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 452. [2025-03-08 15:28:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 371 states have (on average 1.522911051212938) internal successors, (565), 371 states have internal predecessors, (565), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:28:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 721 transitions. [2025-03-08 15:28:38,347 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 721 transitions. Word has length 275 [2025-03-08 15:28:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:38,349 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 721 transitions. [2025-03-08 15:28:38,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 721 transitions. [2025-03-08 15:28:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-08 15:28:38,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:38,355 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:38,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:28:38,355 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:38,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1269012868, now seen corresponding path program 1 times [2025-03-08 15:28:38,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:38,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800811486] [2025-03-08 15:28:38,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:38,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 15:28:38,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 15:28:38,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:38,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:38,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:38,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800811486] [2025-03-08 15:28:38,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800811486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:38,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:38,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:28:38,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622197177] [2025-03-08 15:28:38,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:38,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:28:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:38,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:28:38,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:28:38,821 INFO L87 Difference]: Start difference. First operand 452 states and 721 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:40,266 INFO L93 Difference]: Finished difference Result 2476 states and 3936 transitions. [2025-03-08 15:28:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 15:28:40,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 276 [2025-03-08 15:28:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:40,276 INFO L225 Difference]: With dead ends: 2476 [2025-03-08 15:28:40,277 INFO L226 Difference]: Without dead ends: 2291 [2025-03-08 15:28:40,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:28:40,279 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 2534 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:40,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 2235 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:28:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2025-03-08 15:28:40,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 1404. [2025-03-08 15:28:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1140 states have (on average 1.513157894736842) internal successors, (1725), 1143 states have internal predecessors, (1725), 254 states have call successors, (254), 9 states have call predecessors, (254), 9 states have return successors, (254), 251 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-08 15:28:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2233 transitions. [2025-03-08 15:28:40,436 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2233 transitions. Word has length 276 [2025-03-08 15:28:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:40,437 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2233 transitions. [2025-03-08 15:28:40,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2233 transitions. [2025-03-08 15:28:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-08 15:28:40,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:40,442 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:40,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:28:40,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:40,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1781189947, now seen corresponding path program 1 times [2025-03-08 15:28:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:40,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164331950] [2025-03-08 15:28:40,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:40,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 15:28:40,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 15:28:40,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:40,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:41,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:41,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164331950] [2025-03-08 15:28:41,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164331950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:41,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:28:41,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212807432] [2025-03-08 15:28:41,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:41,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:28:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:41,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:28:41,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:28:41,064 INFO L87 Difference]: Start difference. First operand 1404 states and 2233 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:41,966 INFO L93 Difference]: Finished difference Result 5668 states and 9042 transitions. [2025-03-08 15:28:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 15:28:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 276 [2025-03-08 15:28:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:41,985 INFO L225 Difference]: With dead ends: 5668 [2025-03-08 15:28:41,985 INFO L226 Difference]: Without dead ends: 5062 [2025-03-08 15:28:41,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2025-03-08 15:28:41,989 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 2111 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:41,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 2807 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:28:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2025-03-08 15:28:42,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 2846. [2025-03-08 15:28:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2439 states have (on average 1.5375153751537516) internal successors, (3750), 2449 states have internal predecessors, (3750), 388 states have call successors, (388), 18 states have call predecessors, (388), 18 states have return successors, (388), 378 states have call predecessors, (388), 388 states have call successors, (388) [2025-03-08 15:28:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 4526 transitions. [2025-03-08 15:28:42,121 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 4526 transitions. Word has length 276 [2025-03-08 15:28:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:42,121 INFO L471 AbstractCegarLoop]: Abstraction has 2846 states and 4526 transitions. [2025-03-08 15:28:42,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4526 transitions. [2025-03-08 15:28:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-08 15:28:42,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:42,127 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:42,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:28:42,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash 436568006, now seen corresponding path program 1 times [2025-03-08 15:28:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:42,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720153841] [2025-03-08 15:28:42,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:42,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 15:28:42,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 15:28:42,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:42,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:42,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:42,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720153841] [2025-03-08 15:28:42,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720153841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:42,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:42,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:28:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283670134] [2025-03-08 15:28:42,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:42,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:28:42,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:42,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:28:42,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:28:42,466 INFO L87 Difference]: Start difference. First operand 2846 states and 4526 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:42,748 INFO L93 Difference]: Finished difference Result 7496 states and 11940 transitions. [2025-03-08 15:28:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:28:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 276 [2025-03-08 15:28:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:42,767 INFO L225 Difference]: With dead ends: 7496 [2025-03-08 15:28:42,767 INFO L226 Difference]: Without dead ends: 4723 [2025-03-08 15:28:42,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:28:42,774 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 233 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:42,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1026 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:28:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2025-03-08 15:28:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 2846. [2025-03-08 15:28:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2439 states have (on average 1.5371053710537106) internal successors, (3749), 2449 states have internal predecessors, (3749), 388 states have call successors, (388), 18 states have call predecessors, (388), 18 states have return successors, (388), 378 states have call predecessors, (388), 388 states have call successors, (388) [2025-03-08 15:28:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 4525 transitions. [2025-03-08 15:28:42,892 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 4525 transitions. Word has length 276 [2025-03-08 15:28:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:42,893 INFO L471 AbstractCegarLoop]: Abstraction has 2846 states and 4525 transitions. [2025-03-08 15:28:42,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4525 transitions. [2025-03-08 15:28:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:28:42,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:42,898 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:42,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:28:42,898 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -754034973, now seen corresponding path program 1 times [2025-03-08 15:28:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:42,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021097517] [2025-03-08 15:28:42,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:42,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:28:42,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:28:42,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:42,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021097517] [2025-03-08 15:28:43,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021097517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:43,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:43,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:28:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121071180] [2025-03-08 15:28:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:43,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:28:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:43,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:28:43,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:28:43,304 INFO L87 Difference]: Start difference. First operand 2846 states and 4525 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:43,736 INFO L93 Difference]: Finished difference Result 10671 states and 16960 transitions. [2025-03-08 15:28:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:28:43,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-03-08 15:28:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:43,769 INFO L225 Difference]: With dead ends: 10671 [2025-03-08 15:28:43,769 INFO L226 Difference]: Without dead ends: 7913 [2025-03-08 15:28:43,775 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-08 15:28:43,775 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 630 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:43,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 780 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:28:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2025-03-08 15:28:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 5481. [2025-03-08 15:28:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5481 states, 4806 states have (on average 1.5445276737411568) internal successors, (7423), 4832 states have internal predecessors, (7423), 639 states have call successors, (639), 35 states have call predecessors, (639), 35 states have return successors, (639), 613 states have call predecessors, (639), 639 states have call successors, (639) [2025-03-08 15:28:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5481 states to 5481 states and 8701 transitions. [2025-03-08 15:28:44,026 INFO L78 Accepts]: Start accepts. Automaton has 5481 states and 8701 transitions. Word has length 277 [2025-03-08 15:28:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:44,026 INFO L471 AbstractCegarLoop]: Abstraction has 5481 states and 8701 transitions. [2025-03-08 15:28:44,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 8701 transitions. [2025-03-08 15:28:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:28:44,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:44,039 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:44,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:28:44,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:44,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1083800734, now seen corresponding path program 1 times [2025-03-08 15:28:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:44,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805053261] [2025-03-08 15:28:44,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:44,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:44,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:28:44,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:28:44,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:44,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:44,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805053261] [2025-03-08 15:28:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805053261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:44,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:28:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467938929] [2025-03-08 15:28:44,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:44,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:28:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:44,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:28:44,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:28:44,357 INFO L87 Difference]: Start difference. First operand 5481 states and 8701 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:44,887 INFO L93 Difference]: Finished difference Result 13291 states and 21091 transitions. [2025-03-08 15:28:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:28:44,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-03-08 15:28:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:44,913 INFO L225 Difference]: With dead ends: 13291 [2025-03-08 15:28:44,913 INFO L226 Difference]: Without dead ends: 7913 [2025-03-08 15:28:44,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-08 15:28:44,925 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 460 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:44,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1407 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:28:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2025-03-08 15:28:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 5481. [2025-03-08 15:28:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5481 states, 4806 states have (on average 1.542446941323346) internal successors, (7413), 4832 states have internal predecessors, (7413), 639 states have call successors, (639), 35 states have call predecessors, (639), 35 states have return successors, (639), 613 states have call predecessors, (639), 639 states have call successors, (639) [2025-03-08 15:28:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5481 states to 5481 states and 8691 transitions. [2025-03-08 15:28:45,214 INFO L78 Accepts]: Start accepts. Automaton has 5481 states and 8691 transitions. Word has length 277 [2025-03-08 15:28:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:45,214 INFO L471 AbstractCegarLoop]: Abstraction has 5481 states and 8691 transitions. [2025-03-08 15:28:45,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 8691 transitions. [2025-03-08 15:28:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:28:45,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:45,224 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:45,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:28:45,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:45,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1676718556, now seen corresponding path program 1 times [2025-03-08 15:28:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:45,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085090151] [2025-03-08 15:28:45,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:45,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:28:45,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:28:45,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:45,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085090151] [2025-03-08 15:28:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085090151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:45,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:45,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:28:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578275782] [2025-03-08 15:28:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:45,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:28:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:45,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:28:45,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:28:45,894 INFO L87 Difference]: Start difference. First operand 5481 states and 8691 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:47,616 INFO L93 Difference]: Finished difference Result 21136 states and 33536 transitions. [2025-03-08 15:28:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 15:28:47,617 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-03-08 15:28:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:47,661 INFO L225 Difference]: With dead ends: 21136 [2025-03-08 15:28:47,662 INFO L226 Difference]: Without dead ends: 18804 [2025-03-08 15:28:47,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=567, Unknown=0, NotChecked=0, Total=812 [2025-03-08 15:28:47,677 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 4242 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4242 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:47,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4242 Valid, 2981 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:28:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18804 states. [2025-03-08 15:28:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18804 to 3849. [2025-03-08 15:28:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3286 states have (on average 1.5286062081558125) internal successors, (5023), 3298 states have internal predecessors, (5023), 527 states have call successors, (527), 35 states have call predecessors, (527), 35 states have return successors, (527), 515 states have call predecessors, (527), 527 states have call successors, (527) [2025-03-08 15:28:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 6077 transitions. [2025-03-08 15:28:47,966 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 6077 transitions. Word has length 277 [2025-03-08 15:28:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:47,966 INFO L471 AbstractCegarLoop]: Abstraction has 3849 states and 6077 transitions. [2025-03-08 15:28:47,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 6077 transitions. [2025-03-08 15:28:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:28:47,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:47,973 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:47,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:28:47,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:47,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:47,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2012268738, now seen corresponding path program 1 times [2025-03-08 15:28:47,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:47,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034223072] [2025-03-08 15:28:47,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:47,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:28:48,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:28:48,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:48,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:48,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:48,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034223072] [2025-03-08 15:28:48,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034223072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:48,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:48,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:28:48,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618722395] [2025-03-08 15:28:48,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:48,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:28:48,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:48,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:28:48,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:28:48,165 INFO L87 Difference]: Start difference. First operand 3849 states and 6077 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:49,162 INFO L93 Difference]: Finished difference Result 11821 states and 18647 transitions. [2025-03-08 15:28:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:28:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-03-08 15:28:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:49,184 INFO L225 Difference]: With dead ends: 11821 [2025-03-08 15:28:49,184 INFO L226 Difference]: Without dead ends: 8075 [2025-03-08 15:28:49,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:28:49,194 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1002 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:49,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1235 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:28:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2025-03-08 15:28:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 7277. [2025-03-08 15:28:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7277 states, 6332 states have (on average 1.5427984838913456) internal successors, (9769), 6356 states have internal predecessors, (9769), 887 states have call successors, (887), 57 states have call predecessors, (887), 57 states have return successors, (887), 863 states have call predecessors, (887), 887 states have call successors, (887) [2025-03-08 15:28:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7277 states to 7277 states and 11543 transitions. [2025-03-08 15:28:49,494 INFO L78 Accepts]: Start accepts. Automaton has 7277 states and 11543 transitions. Word has length 277 [2025-03-08 15:28:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:49,496 INFO L471 AbstractCegarLoop]: Abstraction has 7277 states and 11543 transitions. [2025-03-08 15:28:49,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7277 states and 11543 transitions. [2025-03-08 15:28:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:28:49,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:49,506 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:49,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:28:49,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:49,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1037934077, now seen corresponding path program 1 times [2025-03-08 15:28:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:49,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160787662] [2025-03-08 15:28:49,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:49,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:28:49,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:28:49,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:49,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160787662] [2025-03-08 15:28:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160787662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:50,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:50,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 15:28:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914313018] [2025-03-08 15:28:50,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:50,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:28:50,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:50,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:28:50,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:28:50,958 INFO L87 Difference]: Start difference. First operand 7277 states and 11543 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:53,220 INFO L93 Difference]: Finished difference Result 26298 states and 41861 transitions. [2025-03-08 15:28:53,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:28:53,221 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-03-08 15:28:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:53,263 INFO L225 Difference]: With dead ends: 26298 [2025-03-08 15:28:53,264 INFO L226 Difference]: Without dead ends: 19118 [2025-03-08 15:28:53,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2025-03-08 15:28:53,279 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1386 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 2132 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:53,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 2132 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 15:28:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19118 states. [2025-03-08 15:28:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19118 to 17196. [2025-03-08 15:28:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17196 states, 16190 states have (on average 1.5623841877702285) internal successors, (25295), 16226 states have internal predecessors, (25295), 935 states have call successors, (935), 70 states have call predecessors, (935), 70 states have return successors, (935), 899 states have call predecessors, (935), 935 states have call successors, (935) [2025-03-08 15:28:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17196 states to 17196 states and 27165 transitions. [2025-03-08 15:28:53,769 INFO L78 Accepts]: Start accepts. Automaton has 17196 states and 27165 transitions. Word has length 277 [2025-03-08 15:28:53,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:53,769 INFO L471 AbstractCegarLoop]: Abstraction has 17196 states and 27165 transitions. [2025-03-08 15:28:53,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:53,770 INFO L276 IsEmpty]: Start isEmpty. Operand 17196 states and 27165 transitions. [2025-03-08 15:28:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:28:53,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:53,787 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:53,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:28:53,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:53,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:53,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1914727743, now seen corresponding path program 1 times [2025-03-08 15:28:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:53,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383393416] [2025-03-08 15:28:53,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:53,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:28:53,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:28:53,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:53,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:53,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383393416] [2025-03-08 15:28:53,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383393416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:53,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:53,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:28:53,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756582701] [2025-03-08 15:28:53,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:53,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:28:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:53,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:28:53,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:28:53,963 INFO L87 Difference]: Start difference. First operand 17196 states and 27165 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:54,870 INFO L93 Difference]: Finished difference Result 42634 states and 66857 transitions. [2025-03-08 15:28:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:28:54,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-03-08 15:28:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:54,937 INFO L225 Difference]: With dead ends: 42634 [2025-03-08 15:28:54,938 INFO L226 Difference]: Without dead ends: 31622 [2025-03-08 15:28:54,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:28:54,956 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 922 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:54,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1200 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:28:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31622 states. [2025-03-08 15:28:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31622 to 26070. [2025-03-08 15:28:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26070 states, 23658 states have (on average 1.523332487953335) internal successors, (36039), 23756 states have internal predecessors, (36039), 2207 states have call successors, (2207), 204 states have call predecessors, (2207), 204 states have return successors, (2207), 2109 states have call predecessors, (2207), 2207 states have call successors, (2207) [2025-03-08 15:28:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26070 states to 26070 states and 40453 transitions. [2025-03-08 15:28:55,825 INFO L78 Accepts]: Start accepts. Automaton has 26070 states and 40453 transitions. Word has length 277 [2025-03-08 15:28:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:55,826 INFO L471 AbstractCegarLoop]: Abstraction has 26070 states and 40453 transitions. [2025-03-08 15:28:55,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:55,826 INFO L276 IsEmpty]: Start isEmpty. Operand 26070 states and 40453 transitions. [2025-03-08 15:28:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:28:55,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:55,897 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:55,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:28:55,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:55,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:55,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1980309173, now seen corresponding path program 1 times [2025-03-08 15:28:55,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:55,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822232961] [2025-03-08 15:28:55,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:55,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:55,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:28:55,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:28:55,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:55,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:56,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:56,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822232961] [2025-03-08 15:28:56,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822232961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:56,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:56,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:28:56,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552725326] [2025-03-08 15:28:56,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:56,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:28:56,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:56,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:28:56,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:28:56,233 INFO L87 Difference]: Start difference. First operand 26070 states and 40453 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:28:57,576 INFO L93 Difference]: Finished difference Result 44770 states and 69121 transitions. [2025-03-08 15:28:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:28:57,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-03-08 15:28:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:28:57,650 INFO L225 Difference]: With dead ends: 44770 [2025-03-08 15:28:57,650 INFO L226 Difference]: Without dead ends: 36036 [2025-03-08 15:28:57,666 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-08 15:28:57,667 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 221 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:28:57,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1055 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:28:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36036 states. [2025-03-08 15:28:58,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36036 to 28774. [2025-03-08 15:28:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28774 states, 26362 states have (on average 1.5241256353842652) internal successors, (40179), 26460 states have internal predecessors, (40179), 2207 states have call successors, (2207), 204 states have call predecessors, (2207), 204 states have return successors, (2207), 2109 states have call predecessors, (2207), 2207 states have call successors, (2207) [2025-03-08 15:28:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28774 states to 28774 states and 44593 transitions. [2025-03-08 15:28:58,620 INFO L78 Accepts]: Start accepts. Automaton has 28774 states and 44593 transitions. Word has length 277 [2025-03-08 15:28:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:28:58,621 INFO L471 AbstractCegarLoop]: Abstraction has 28774 states and 44593 transitions. [2025-03-08 15:28:58,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:28:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28774 states and 44593 transitions. [2025-03-08 15:28:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:28:58,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:28:58,640 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:28:58,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:28:58,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:28:58,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:28:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash -624203134, now seen corresponding path program 1 times [2025-03-08 15:28:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:28:58,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758509033] [2025-03-08 15:28:58,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:28:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:28:58,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:28:58,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:28:58,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:28:58,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:28:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:28:58,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:28:58,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758509033] [2025-03-08 15:28:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758509033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:28:58,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:28:58,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:28:58,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768298364] [2025-03-08 15:28:58,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:28:58,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:28:58,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:28:58,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:28:58,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:28:58,992 INFO L87 Difference]: Start difference. First operand 28774 states and 44593 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:29:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:29:00,103 INFO L93 Difference]: Finished difference Result 44162 states and 68915 transitions. [2025-03-08 15:29:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:29:00,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 277 [2025-03-08 15:29:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:29:00,177 INFO L225 Difference]: With dead ends: 44162 [2025-03-08 15:29:00,177 INFO L226 Difference]: Without dead ends: 41901 [2025-03-08 15:29:00,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:29:00,191 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 676 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:29:00,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1704 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:29:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41901 states. [2025-03-08 15:29:01,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41901 to 40369. [2025-03-08 15:29:01,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40369 states, 37338 states have (on average 1.534817076436874) internal successors, (57307), 37470 states have internal predecessors, (57307), 2783 states have call successors, (2783), 247 states have call predecessors, (2783), 247 states have return successors, (2783), 2651 states have call predecessors, (2783), 2783 states have call successors, (2783) [2025-03-08 15:29:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40369 states to 40369 states and 62873 transitions. [2025-03-08 15:29:01,590 INFO L78 Accepts]: Start accepts. Automaton has 40369 states and 62873 transitions. Word has length 277 [2025-03-08 15:29:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:29:01,591 INFO L471 AbstractCegarLoop]: Abstraction has 40369 states and 62873 transitions. [2025-03-08 15:29:01,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:29:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 40369 states and 62873 transitions. [2025-03-08 15:29:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:29:01,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:29:01,616 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:29:01,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:29:01,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:29:01,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:29:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1593554819, now seen corresponding path program 1 times [2025-03-08 15:29:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:29:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779961333] [2025-03-08 15:29:01,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:29:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:29:01,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:29:01,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:29:01,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:29:01,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:29:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:29:03,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:29:03,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779961333] [2025-03-08 15:29:03,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779961333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:29:03,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:29:03,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 15:29:03,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272983616] [2025-03-08 15:29:03,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:29:03,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:29:03,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:29:03,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:29:03,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:29:03,355 INFO L87 Difference]: Start difference. First operand 40369 states and 62873 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 15:29:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:29:15,425 INFO L93 Difference]: Finished difference Result 168783 states and 258517 transitions. [2025-03-08 15:29:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 15:29:15,425 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 277 [2025-03-08 15:29:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:29:15,815 INFO L225 Difference]: With dead ends: 168783 [2025-03-08 15:29:15,815 INFO L226 Difference]: Without dead ends: 152259 [2025-03-08 15:29:15,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=331, Invalid=859, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 15:29:15,877 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 3330 mSDsluCounter, 3979 mSDsCounter, 0 mSdLazyCounter, 4351 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3330 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 4742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 4351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:29:15,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3330 Valid, 4533 Invalid, 4742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 4351 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-08 15:29:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152259 states. [2025-03-08 15:29:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152259 to 72899. [2025-03-08 15:29:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72899 states, 65208 states have (on average 1.5229879769353454) internal successors, (99311), 65572 states have internal predecessors, (99311), 6991 states have call successors, (6991), 699 states have call predecessors, (6991), 699 states have return successors, (6991), 6627 states have call predecessors, (6991), 6991 states have call successors, (6991) [2025-03-08 15:29:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72899 states to 72899 states and 113293 transitions. [2025-03-08 15:29:19,991 INFO L78 Accepts]: Start accepts. Automaton has 72899 states and 113293 transitions. Word has length 277 [2025-03-08 15:29:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:29:19,992 INFO L471 AbstractCegarLoop]: Abstraction has 72899 states and 113293 transitions. [2025-03-08 15:29:19,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 15:29:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 72899 states and 113293 transitions. [2025-03-08 15:29:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 15:29:20,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:29:20,016 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:29:20,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:29:20,016 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:29:20,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:29:20,017 INFO L85 PathProgramCache]: Analyzing trace with hash 837376865, now seen corresponding path program 1 times [2025-03-08 15:29:20,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:29:20,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705960909] [2025-03-08 15:29:20,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:29:20,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:29:20,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 15:29:20,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 15:29:20,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:29:20,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:29:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:29:20,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:29:20,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705960909] [2025-03-08 15:29:20,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705960909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:29:20,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:29:20,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:29:20,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887930218] [2025-03-08 15:29:20,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:29:20,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:29:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:29:20,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:29:20,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:29:20,596 INFO L87 Difference]: Start difference. First operand 72899 states and 113293 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 15:29:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:29:25,467 INFO L93 Difference]: Finished difference Result 88917 states and 138411 transitions. [2025-03-08 15:29:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:29:25,468 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 277 [2025-03-08 15:29:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:29:25,624 INFO L225 Difference]: With dead ends: 88917 [2025-03-08 15:29:25,624 INFO L226 Difference]: Without dead ends: 78609 [2025-03-08 15:29:25,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:29:25,652 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1342 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:29:25,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 2216 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:29:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78609 states. [2025-03-08 15:29:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78609 to 70241. [2025-03-08 15:29:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70241 states, 62836 states have (on average 1.521373098223948) internal successors, (95597), 63192 states have internal predecessors, (95597), 6727 states have call successors, (6727), 677 states have call predecessors, (6727), 677 states have return successors, (6727), 6371 states have call predecessors, (6727), 6727 states have call successors, (6727) [2025-03-08 15:29:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70241 states to 70241 states and 109051 transitions. [2025-03-08 15:29:29,021 INFO L78 Accepts]: Start accepts. Automaton has 70241 states and 109051 transitions. Word has length 277 [2025-03-08 15:29:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:29:29,021 INFO L471 AbstractCegarLoop]: Abstraction has 70241 states and 109051 transitions. [2025-03-08 15:29:29,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 15:29:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 70241 states and 109051 transitions. [2025-03-08 15:29:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 15:29:29,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:29:29,043 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:29:29,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:29:29,043 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:29:29,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:29:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2096911723, now seen corresponding path program 1 times [2025-03-08 15:29:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:29:29,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407770387] [2025-03-08 15:29:29,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:29:29,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:29:29,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 15:29:29,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 15:29:29,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:29:29,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:29:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:29:29,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:29:29,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407770387] [2025-03-08 15:29:29,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407770387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:29:29,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:29:29,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:29:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575388636] [2025-03-08 15:29:29,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:29:29,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:29:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:29:29,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:29:29,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:29:29,359 INFO L87 Difference]: Start difference. First operand 70241 states and 109051 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:29:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:29:33,741 INFO L93 Difference]: Finished difference Result 104812 states and 161815 transitions. [2025-03-08 15:29:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:29:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 278 [2025-03-08 15:29:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:29:33,912 INFO L225 Difference]: With dead ends: 104812 [2025-03-08 15:29:33,912 INFO L226 Difference]: Without dead ends: 83163 [2025-03-08 15:29:33,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:29:33,968 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1788 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:29:33,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1788 Valid, 2359 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:29:34,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83163 states. [2025-03-08 15:29:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83163 to 74361. [2025-03-08 15:29:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74361 states, 66744 states have (on average 1.5209307203643774) internal successors, (101513), 67120 states have internal predecessors, (101513), 6903 states have call successors, (6903), 713 states have call predecessors, (6903), 713 states have return successors, (6903), 6527 states have call predecessors, (6903), 6903 states have call successors, (6903) [2025-03-08 15:29:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74361 states to 74361 states and 115319 transitions. [2025-03-08 15:29:37,460 INFO L78 Accepts]: Start accepts. Automaton has 74361 states and 115319 transitions. Word has length 278 [2025-03-08 15:29:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:29:37,460 INFO L471 AbstractCegarLoop]: Abstraction has 74361 states and 115319 transitions. [2025-03-08 15:29:37,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:29:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 74361 states and 115319 transitions. [2025-03-08 15:29:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 15:29:37,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:29:37,487 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:29:37,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:29:37,487 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:29:37,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:29:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 804365687, now seen corresponding path program 1 times [2025-03-08 15:29:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:29:37,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914969418] [2025-03-08 15:29:37,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:29:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:29:37,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 15:29:37,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 15:29:37,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:29:37,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:29:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:29:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:29:38,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914969418] [2025-03-08 15:29:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914969418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:29:38,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:29:38,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:29:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966736716] [2025-03-08 15:29:38,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:29:38,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:29:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:29:38,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:29:38,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:29:38,095 INFO L87 Difference]: Start difference. First operand 74361 states and 115319 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-08 15:29:44,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:29:44,161 INFO L93 Difference]: Finished difference Result 146917 states and 227189 transitions. [2025-03-08 15:29:44,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:29:44,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 278 [2025-03-08 15:29:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:29:44,336 INFO L225 Difference]: With dead ends: 146917 [2025-03-08 15:29:44,336 INFO L226 Difference]: Without dead ends: 91301 [2025-03-08 15:29:44,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:29:44,403 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 1144 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:29:44,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 728 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:29:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91301 states. [2025-03-08 15:29:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91301 to 52751. [2025-03-08 15:29:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52751 states, 49120 states have (on average 1.542121335504886) internal successors, (75749), 49274 states have internal predecessors, (75749), 3239 states have call successors, (3239), 391 states have call predecessors, (3239), 391 states have return successors, (3239), 3085 states have call predecessors, (3239), 3239 states have call successors, (3239) [2025-03-08 15:29:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52751 states to 52751 states and 82227 transitions. [2025-03-08 15:29:47,136 INFO L78 Accepts]: Start accepts. Automaton has 52751 states and 82227 transitions. Word has length 278 [2025-03-08 15:29:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:29:47,137 INFO L471 AbstractCegarLoop]: Abstraction has 52751 states and 82227 transitions. [2025-03-08 15:29:47,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-08 15:29:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 52751 states and 82227 transitions. [2025-03-08 15:29:47,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 15:29:47,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:29:47,163 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:29:47,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:29:47,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:29:47,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:29:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash -95888416, now seen corresponding path program 1 times [2025-03-08 15:29:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:29:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35080386] [2025-03-08 15:29:47,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:29:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:29:47,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 15:29:47,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 15:29:47,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:29:47,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:29:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:29:48,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:29:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35080386] [2025-03-08 15:29:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35080386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:29:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:29:48,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:29:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19725232] [2025-03-08 15:29:48,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:29:48,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:29:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:29:48,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:29:48,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:29:48,158 INFO L87 Difference]: Start difference. First operand 52751 states and 82227 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 2 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39)