./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.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 433e151ff3abdaf4e4718c9ced99d2dc7cf27dfb3e48e73977d43bba901b54fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:51:37,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:51:37,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:51:37,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:51:37,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:51:37,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:51:37,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:51:37,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:51:37,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:51:37,840 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:51:37,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:51:37,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:51:37,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:51:37,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:51:37,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:51:37,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:51:37,843 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:51:37,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:51:37,843 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:51:37,843 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:51:37,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:51:37,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:51:37,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:51:37,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:51:37,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:51:37,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:51:37,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:51:37,845 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 -> 433e151ff3abdaf4e4718c9ced99d2dc7cf27dfb3e48e73977d43bba901b54fd [2025-03-17 04:51:38,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:51:38,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:51:38,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:51:38,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:51:38,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:51:38,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i [2025-03-17 04:51:39,278 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2310f4f/ad7dfcdd1abe4241bea7b81651f98f96/FLAG25d5dff7d [2025-03-17 04:51:39,667 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:51:39,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i [2025-03-17 04:51:39,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2310f4f/ad7dfcdd1abe4241bea7b81651f98f96/FLAG25d5dff7d [2025-03-17 04:51:39,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2310f4f/ad7dfcdd1abe4241bea7b81651f98f96 [2025-03-17 04:51:39,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:51:39,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:51:39,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:51:39,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:51:39,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:51:39,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:51:39" (1/1) ... [2025-03-17 04:51:39,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709691d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:39, skipping insertion in model container [2025-03-17 04:51:39,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:51:39" (1/1) ... [2025-03-17 04:51:39,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:51:39,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i[916,929] [2025-03-17 04:51:40,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:51:40,068 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:51:40,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-53.i[916,929] [2025-03-17 04:51:40,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:51:40,189 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:51:40,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40 WrapperNode [2025-03-17 04:51:40,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:51:40,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:51:40,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:51:40,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:51:40,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,283 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 609 [2025-03-17 04:51:40,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:51:40,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:51:40,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:51:40,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:51:40,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,382 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:51:40,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:51:40,438 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:51:40,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:51:40,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:51:40,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (1/1) ... [2025-03-17 04:51:40,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:51:40,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:51:40,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:51:40,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:51:40,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:51:40,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:51:40,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:51:40,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:51:40,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:51:40,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:51:40,591 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:51:40,592 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:51:41,513 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1; [2025-03-17 04:51:41,599 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-17 04:51:41,599 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:51:41,623 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:51:41,624 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:51:41,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:51:41 BoogieIcfgContainer [2025-03-17 04:51:41,624 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:51:41,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:51:41,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:51:41,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:51:41,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:51:39" (1/3) ... [2025-03-17 04:51:41,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7ccc96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:51:41, skipping insertion in model container [2025-03-17 04:51:41,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:51:40" (2/3) ... [2025-03-17 04:51:41,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7ccc96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:51:41, skipping insertion in model container [2025-03-17 04:51:41,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:51:41" (3/3) ... [2025-03-17 04:51:41,632 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-53.i [2025-03-17 04:51:41,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:51:41,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-53.i that has 2 procedures, 243 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:51:41,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:51:41,714 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;@15c8e560, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:51:41,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:51:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 173 states have (on average 1.5895953757225434) internal successors, (275), 174 states have internal predecessors, (275), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 04:51:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:41,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:41,744 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:41,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:41,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 229529010, now seen corresponding path program 1 times [2025-03-17 04:51:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:41,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121658552] [2025-03-17 04:51:41,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:41,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:41,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:41,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:41,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-17 04:51:42,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121658552] [2025-03-17 04:51:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121658552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:51:42,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705756501] [2025-03-17 04:51:42,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:42,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:51:42,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:51:42,421 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:51:42,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:51:42,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:42,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:42,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:42,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:42,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:51:42,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:51:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-03-17 04:51:42,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:51:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705756501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:51:42,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:51:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366828347] [2025-03-17 04:51:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:51:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:42,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:51:42,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:51:42,873 INFO L87 Difference]: Start difference. First operand has 243 states, 173 states have (on average 1.5895953757225434) internal successors, (275), 174 states have internal predecessors, (275), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-17 04:51:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:42,944 INFO L93 Difference]: Finished difference Result 483 states and 883 transitions. [2025-03-17 04:51:42,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:51:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 453 [2025-03-17 04:51:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:42,953 INFO L225 Difference]: With dead ends: 483 [2025-03-17 04:51:42,953 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 04:51:42,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:51:42,962 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:42,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:51:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 04:51:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-03-17 04:51:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 172 states have (on average 1.563953488372093) internal successors, (269), 172 states have internal predecessors, (269), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 04:51:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 403 transitions. [2025-03-17 04:51:43,039 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 403 transitions. Word has length 453 [2025-03-17 04:51:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:43,041 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 403 transitions. [2025-03-17 04:51:43,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.5) internal successors, (123), 2 states have internal predecessors, (123), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-17 04:51:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 403 transitions. [2025-03-17 04:51:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:43,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:43,053 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:43,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:51:43,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:51:43,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:43,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1437864783, now seen corresponding path program 1 times [2025-03-17 04:51:43,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:43,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700096398] [2025-03-17 04:51:43,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:43,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:43,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:43,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:43,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:43,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:43,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700096398] [2025-03-17 04:51:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700096398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:43,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:43,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:51:43,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14578692] [2025-03-17 04:51:43,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:43,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:51:43,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:43,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:51:43,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:43,773 INFO L87 Difference]: Start difference. First operand 241 states and 403 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:43,859 INFO L93 Difference]: Finished difference Result 603 states and 1014 transitions. [2025-03-17 04:51:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:51:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:43,865 INFO L225 Difference]: With dead ends: 603 [2025-03-17 04:51:43,866 INFO L226 Difference]: Without dead ends: 363 [2025-03-17 04:51:43,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:43,868 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 208 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:43,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 775 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:51:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-17 04:51:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 253. [2025-03-17 04:51:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 184 states have (on average 1.5706521739130435) internal successors, (289), 184 states have internal predecessors, (289), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 04:51:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 423 transitions. [2025-03-17 04:51:43,896 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 423 transitions. Word has length 453 [2025-03-17 04:51:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:43,899 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 423 transitions. [2025-03-17 04:51:43,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 423 transitions. [2025-03-17 04:51:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:43,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:43,906 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:43,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:51:43,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1410811480, now seen corresponding path program 1 times [2025-03-17 04:51:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:43,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032076728] [2025-03-17 04:51:43,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:43,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:43,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:44,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:44,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:44,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:44,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032076728] [2025-03-17 04:51:44,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032076728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:44,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:44,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:51:44,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930560586] [2025-03-17 04:51:44,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:51:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:44,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:51:44,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:44,252 INFO L87 Difference]: Start difference. First operand 253 states and 423 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:44,364 INFO L93 Difference]: Finished difference Result 653 states and 1091 transitions. [2025-03-17 04:51:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:51:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:44,370 INFO L225 Difference]: With dead ends: 653 [2025-03-17 04:51:44,371 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 04:51:44,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:44,374 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 224 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:44,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 776 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:51:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 04:51:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 398. [2025-03-17 04:51:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 302 states have (on average 1.586092715231788) internal successors, (479), 303 states have internal predecessors, (479), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 04:51:44,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 665 transitions. [2025-03-17 04:51:44,407 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 665 transitions. Word has length 453 [2025-03-17 04:51:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:44,408 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 665 transitions. [2025-03-17 04:51:44,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 665 transitions. [2025-03-17 04:51:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:44,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:44,415 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:44,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:51:44,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:44,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1212612582, now seen corresponding path program 1 times [2025-03-17 04:51:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42617344] [2025-03-17 04:51:44,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:44,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:44,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:44,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:44,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:44,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:44,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42617344] [2025-03-17 04:51:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42617344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:44,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:51:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694192021] [2025-03-17 04:51:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:44,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:51:44,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:44,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:51:44,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:44,781 INFO L87 Difference]: Start difference. First operand 398 states and 665 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:44,940 INFO L93 Difference]: Finished difference Result 1100 states and 1838 transitions. [2025-03-17 04:51:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:51:44,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:44,949 INFO L225 Difference]: With dead ends: 1100 [2025-03-17 04:51:44,949 INFO L226 Difference]: Without dead ends: 703 [2025-03-17 04:51:44,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:44,951 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 268 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:44,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 896 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:51:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-17 04:51:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 699. [2025-03-17 04:51:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 553 states have (on average 1.5913200723327305) internal successors, (880), 556 states have internal predecessors, (880), 141 states have call successors, (141), 4 states have call predecessors, (141), 4 states have return successors, (141), 138 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-17 04:51:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1162 transitions. [2025-03-17 04:51:45,005 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1162 transitions. Word has length 453 [2025-03-17 04:51:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:45,006 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1162 transitions. [2025-03-17 04:51:45,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1162 transitions. [2025-03-17 04:51:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:45,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:45,017 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:45,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:51:45,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:45,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash -40107174, now seen corresponding path program 1 times [2025-03-17 04:51:45,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:45,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269910839] [2025-03-17 04:51:45,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:45,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:45,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:45,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:45,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:45,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:45,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:45,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:45,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269910839] [2025-03-17 04:51:45,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269910839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:45,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:45,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:51:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660835735] [2025-03-17 04:51:45,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:51:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:45,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:51:45,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:45,323 INFO L87 Difference]: Start difference. First operand 699 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:45,455 INFO L93 Difference]: Finished difference Result 2091 states and 3476 transitions. [2025-03-17 04:51:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:51:45,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:45,465 INFO L225 Difference]: With dead ends: 2091 [2025-03-17 04:51:45,466 INFO L226 Difference]: Without dead ends: 1393 [2025-03-17 04:51:45,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:45,470 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 386 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:45,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1141 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:51:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-17 04:51:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1387. [2025-03-17 04:51:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1096 states have (on average 1.5784671532846715) internal successors, (1730), 1102 states have internal predecessors, (1730), 282 states have call successors, (282), 8 states have call predecessors, (282), 8 states have return successors, (282), 276 states have call predecessors, (282), 282 states have call successors, (282) [2025-03-17 04:51:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 2294 transitions. [2025-03-17 04:51:45,580 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 2294 transitions. Word has length 453 [2025-03-17 04:51:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:45,581 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 2294 transitions. [2025-03-17 04:51:45,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 2294 transitions. [2025-03-17 04:51:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:45,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:45,590 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:45,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:51:45,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:45,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1685373723, now seen corresponding path program 1 times [2025-03-17 04:51:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939760230] [2025-03-17 04:51:45,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:45,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:45,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:45,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:45,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939760230] [2025-03-17 04:51:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939760230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:45,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:51:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732751729] [2025-03-17 04:51:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:45,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:51:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:45,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:51:45,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:45,997 INFO L87 Difference]: Start difference. First operand 1387 states and 2294 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:46,188 INFO L93 Difference]: Finished difference Result 4143 states and 6848 transitions. [2025-03-17 04:51:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:51:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:46,213 INFO L225 Difference]: With dead ends: 4143 [2025-03-17 04:51:46,213 INFO L226 Difference]: Without dead ends: 2757 [2025-03-17 04:51:46,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:46,218 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 378 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:46,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1119 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:51:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2025-03-17 04:51:46,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2755. [2025-03-17 04:51:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2174 states have (on average 1.5648574057037719) internal successors, (3402), 2186 states have internal predecessors, (3402), 564 states have call successors, (564), 16 states have call predecessors, (564), 16 states have return successors, (564), 552 states have call predecessors, (564), 564 states have call successors, (564) [2025-03-17 04:51:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 4530 transitions. [2025-03-17 04:51:46,424 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 4530 transitions. Word has length 453 [2025-03-17 04:51:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:46,425 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 4530 transitions. [2025-03-17 04:51:46,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 4530 transitions. [2025-03-17 04:51:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:46,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:46,432 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:46,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:51:46,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2015139484, now seen corresponding path program 1 times [2025-03-17 04:51:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394549757] [2025-03-17 04:51:46,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:46,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:46,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:46,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:46,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:46,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394549757] [2025-03-17 04:51:46,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394549757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:46,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:51:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100534604] [2025-03-17 04:51:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:46,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:51:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:46,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:51:46,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:46,680 INFO L87 Difference]: Start difference. First operand 2755 states and 4530 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:46,877 INFO L93 Difference]: Finished difference Result 7599 states and 12456 transitions. [2025-03-17 04:51:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:51:46,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:46,909 INFO L225 Difference]: With dead ends: 7599 [2025-03-17 04:51:46,910 INFO L226 Difference]: Without dead ends: 4845 [2025-03-17 04:51:46,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:46,920 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 273 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:46,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 777 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:51:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2025-03-17 04:51:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4839. [2025-03-17 04:51:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 3686 states have (on average 1.5328269126424308) internal successors, (5650), 3714 states have internal predecessors, (5650), 1120 states have call successors, (1120), 32 states have call predecessors, (1120), 32 states have return successors, (1120), 1092 states have call predecessors, (1120), 1120 states have call successors, (1120) [2025-03-17 04:51:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 7890 transitions. [2025-03-17 04:51:47,250 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 7890 transitions. Word has length 453 [2025-03-17 04:51:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:47,251 INFO L471 AbstractCegarLoop]: Abstraction has 4839 states and 7890 transitions. [2025-03-17 04:51:47,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 7890 transitions. [2025-03-17 04:51:47,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:47,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:47,257 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:47,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:51:47,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:47,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1500456793, now seen corresponding path program 1 times [2025-03-17 04:51:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:47,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691358538] [2025-03-17 04:51:47,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:47,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:47,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:47,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:47,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:47,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:47,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691358538] [2025-03-17 04:51:47,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691358538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:47,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:47,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:51:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754371721] [2025-03-17 04:51:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:47,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:51:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:47,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:51:47,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:47,990 INFO L87 Difference]: Start difference. First operand 4839 states and 7890 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:48,435 INFO L93 Difference]: Finished difference Result 14515 states and 23668 transitions. [2025-03-17 04:51:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:51:48,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:48,493 INFO L225 Difference]: With dead ends: 14515 [2025-03-17 04:51:48,494 INFO L226 Difference]: Without dead ends: 9677 [2025-03-17 04:51:48,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:51:48,512 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 223 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:48,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 780 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:51:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2025-03-17 04:51:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 9643. [2025-03-17 04:51:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9643 states, 7338 states have (on average 1.5243935677296265) internal successors, (11186), 7394 states have internal predecessors, (11186), 2240 states have call successors, (2240), 64 states have call predecessors, (2240), 64 states have return successors, (2240), 2184 states have call predecessors, (2240), 2240 states have call successors, (2240) [2025-03-17 04:51:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9643 states to 9643 states and 15666 transitions. [2025-03-17 04:51:49,200 INFO L78 Accepts]: Start accepts. Automaton has 9643 states and 15666 transitions. Word has length 453 [2025-03-17 04:51:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:49,201 INFO L471 AbstractCegarLoop]: Abstraction has 9643 states and 15666 transitions. [2025-03-17 04:51:49,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 9643 states and 15666 transitions. [2025-03-17 04:51:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:49,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:49,215 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:49,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:51:49,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:49,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1303943288, now seen corresponding path program 1 times [2025-03-17 04:51:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425490302] [2025-03-17 04:51:49,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:49,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:49,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:49,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:49,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:49,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425490302] [2025-03-17 04:51:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425490302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:51,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:51,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:51:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220071149] [2025-03-17 04:51:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:51,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:51:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:51,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:51:51,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:51:51,108 INFO L87 Difference]: Start difference. First operand 9643 states and 15666 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:52,560 INFO L93 Difference]: Finished difference Result 27860 states and 45128 transitions. [2025-03-17 04:51:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:51:52,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:52,646 INFO L225 Difference]: With dead ends: 27860 [2025-03-17 04:51:52,647 INFO L226 Difference]: Without dead ends: 18218 [2025-03-17 04:51:52,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:51:52,681 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1222 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:52,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 2288 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:51:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18218 states. [2025-03-17 04:51:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18218 to 11808. [2025-03-17 04:51:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11808 states, 9432 states have (on average 1.561386768447837) internal successors, (14727), 9488 states have internal predecessors, (14727), 2307 states have call successors, (2307), 68 states have call predecessors, (2307), 68 states have return successors, (2307), 2251 states have call predecessors, (2307), 2307 states have call successors, (2307) [2025-03-17 04:51:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11808 states to 11808 states and 19341 transitions. [2025-03-17 04:51:53,351 INFO L78 Accepts]: Start accepts. Automaton has 11808 states and 19341 transitions. Word has length 453 [2025-03-17 04:51:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:53,352 INFO L471 AbstractCegarLoop]: Abstraction has 11808 states and 19341 transitions. [2025-03-17 04:51:53,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 11808 states and 19341 transitions. [2025-03-17 04:51:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:53,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:53,362 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:53,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:51:53,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 348422009, now seen corresponding path program 1 times [2025-03-17 04:51:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:53,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038752955] [2025-03-17 04:51:53,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:53,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:54,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:54,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:54,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038752955] [2025-03-17 04:51:54,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038752955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:54,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:54,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:51:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396865281] [2025-03-17 04:51:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:54,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:51:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:54,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:51:54,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:51:54,536 INFO L87 Difference]: Start difference. First operand 11808 states and 19341 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:55,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:55,503 INFO L93 Difference]: Finished difference Result 41065 states and 67333 transitions. [2025-03-17 04:51:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:51:55,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:55,606 INFO L225 Difference]: With dead ends: 41065 [2025-03-17 04:51:55,606 INFO L226 Difference]: Without dead ends: 27624 [2025-03-17 04:51:55,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:51:55,653 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 511 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:55,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1064 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:51:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27624 states. [2025-03-17 04:51:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27624 to 17588. [2025-03-17 04:51:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17588 states, 15211 states have (on average 1.5929919137466306) internal successors, (24231), 15267 states have internal predecessors, (24231), 2307 states have call successors, (2307), 69 states have call predecessors, (2307), 69 states have return successors, (2307), 2251 states have call predecessors, (2307), 2307 states have call successors, (2307) [2025-03-17 04:51:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17588 states to 17588 states and 28845 transitions. [2025-03-17 04:51:56,535 INFO L78 Accepts]: Start accepts. Automaton has 17588 states and 28845 transitions. Word has length 453 [2025-03-17 04:51:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:56,536 INFO L471 AbstractCegarLoop]: Abstraction has 17588 states and 28845 transitions. [2025-03-17 04:51:56,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 17588 states and 28845 transitions. [2025-03-17 04:51:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:56,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:56,553 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:56,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:51:56,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash 359263898, now seen corresponding path program 1 times [2025-03-17 04:51:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:56,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206712508] [2025-03-17 04:51:56,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:56,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:51:57,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:51:57,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:51:57,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:51:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:51:57,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:51:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206712508] [2025-03-17 04:51:57,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206712508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:51:57,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:51:57,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:51:57,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257138823] [2025-03-17 04:51:57,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:51:57,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:51:57,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:51:57,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:51:57,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:51:57,703 INFO L87 Difference]: Start difference. First operand 17588 states and 28845 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:51:58,578 INFO L93 Difference]: Finished difference Result 46318 states and 75756 transitions. [2025-03-17 04:51:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:51:58,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:51:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:51:58,671 INFO L225 Difference]: With dead ends: 46318 [2025-03-17 04:51:58,671 INFO L226 Difference]: Without dead ends: 28879 [2025-03-17 04:51:58,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:51:58,709 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 649 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:51:58,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1174 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:51:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28879 states. [2025-03-17 04:51:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28879 to 21556. [2025-03-17 04:51:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21556 states, 18027 states have (on average 1.5604925944416708) internal successors, (28131), 18112 states have internal predecessors, (28131), 3427 states have call successors, (3427), 101 states have call predecessors, (3427), 101 states have return successors, (3427), 3342 states have call predecessors, (3427), 3427 states have call successors, (3427) [2025-03-17 04:51:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21556 states to 21556 states and 34985 transitions. [2025-03-17 04:51:59,701 INFO L78 Accepts]: Start accepts. Automaton has 21556 states and 34985 transitions. Word has length 453 [2025-03-17 04:51:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:51:59,702 INFO L471 AbstractCegarLoop]: Abstraction has 21556 states and 34985 transitions. [2025-03-17 04:51:59,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:51:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 21556 states and 34985 transitions. [2025-03-17 04:51:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:51:59,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:51:59,714 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:51:59,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:51:59,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:51:59,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:51:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2113129894, now seen corresponding path program 1 times [2025-03-17 04:51:59,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:51:59,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155580615] [2025-03-17 04:51:59,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:51:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:51:59,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:52:00,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:52:00,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:00,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:52:00,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:52:00,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155580615] [2025-03-17 04:52:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155580615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:52:00,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:52:00,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:52:00,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556117867] [2025-03-17 04:52:00,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:52:00,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:52:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:52:00,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:52:00,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:52:00,994 INFO L87 Difference]: Start difference. First operand 21556 states and 34985 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-17 04:52:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:52:03,789 INFO L93 Difference]: Finished difference Result 78506 states and 127108 transitions. [2025-03-17 04:52:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:52:03,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 453 [2025-03-17 04:52:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:52:04,000 INFO L225 Difference]: With dead ends: 78506 [2025-03-17 04:52:04,000 INFO L226 Difference]: Without dead ends: 57076 [2025-03-17 04:52:04,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:52:04,066 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 1302 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:52:04,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 1176 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 04:52:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57076 states. [2025-03-17 04:52:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57076 to 37944. [2025-03-17 04:52:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37944 states, 33743 states have (on average 1.580979758764781) internal successors, (53347), 33924 states have internal predecessors, (53347), 4003 states have call successors, (4003), 197 states have call predecessors, (4003), 197 states have return successors, (4003), 3822 states have call predecessors, (4003), 4003 states have call successors, (4003) [2025-03-17 04:52:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37944 states to 37944 states and 61353 transitions. [2025-03-17 04:52:06,371 INFO L78 Accepts]: Start accepts. Automaton has 37944 states and 61353 transitions. Word has length 453 [2025-03-17 04:52:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:52:06,371 INFO L471 AbstractCegarLoop]: Abstraction has 37944 states and 61353 transitions. [2025-03-17 04:52:06,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-17 04:52:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 37944 states and 61353 transitions. [2025-03-17 04:52:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:52:06,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:52:06,391 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:52:06,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:52:06,391 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:52:06,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:52:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1337365531, now seen corresponding path program 1 times [2025-03-17 04:52:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:52:06,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846519427] [2025-03-17 04:52:06,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:52:06,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:52:06,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:52:06,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:06,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:52:07,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:52:07,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846519427] [2025-03-17 04:52:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846519427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:52:07,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:52:07,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:52:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552605439] [2025-03-17 04:52:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:52:07,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:52:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:52:07,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:52:07,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:52:07,630 INFO L87 Difference]: Start difference. First operand 37944 states and 61353 transitions. Second operand has 8 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-17 04:52:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:52:10,186 INFO L93 Difference]: Finished difference Result 100585 states and 162180 transitions. [2025-03-17 04:52:10,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:52:10,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 453 [2025-03-17 04:52:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:52:10,310 INFO L225 Difference]: With dead ends: 100585 [2025-03-17 04:52:10,310 INFO L226 Difference]: Without dead ends: 62767 [2025-03-17 04:52:10,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:52:10,352 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 824 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2513 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:52:10,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 2513 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 04:52:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62767 states. [2025-03-17 04:52:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62767 to 50773. [2025-03-17 04:52:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50773 states, 46092 states have (on average 1.5804694957910266) internal successors, (72847), 46432 states have internal predecessors, (72847), 4323 states have call successors, (4323), 357 states have call predecessors, (4323), 357 states have return successors, (4323), 3983 states have call predecessors, (4323), 4323 states have call successors, (4323) [2025-03-17 04:52:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50773 states to 50773 states and 81493 transitions. [2025-03-17 04:52:12,450 INFO L78 Accepts]: Start accepts. Automaton has 50773 states and 81493 transitions. Word has length 453 [2025-03-17 04:52:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:52:12,451 INFO L471 AbstractCegarLoop]: Abstraction has 50773 states and 81493 transitions. [2025-03-17 04:52:12,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-17 04:52:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 50773 states and 81493 transitions. [2025-03-17 04:52:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:52:12,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:52:12,515 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:52:12,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:52:12,516 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:52:12,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:52:12,518 INFO L85 PathProgramCache]: Analyzing trace with hash 381844252, now seen corresponding path program 1 times [2025-03-17 04:52:12,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:52:12,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900511714] [2025-03-17 04:52:12,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:52:12,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:52:13,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:52:13,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:13,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:52:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:52:13,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900511714] [2025-03-17 04:52:13,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900511714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:52:13,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:52:13,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:52:13,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510520815] [2025-03-17 04:52:13,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:52:13,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:52:13,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:52:13,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:52:13,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:52:13,927 INFO L87 Difference]: Start difference. First operand 50773 states and 81493 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:52:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:52:15,215 INFO L93 Difference]: Finished difference Result 91119 states and 146242 transitions. [2025-03-17 04:52:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:52:15,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:52:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:52:15,490 INFO L225 Difference]: With dead ends: 91119 [2025-03-17 04:52:15,490 INFO L226 Difference]: Without dead ends: 49909 [2025-03-17 04:52:15,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:52:15,597 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 372 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:52:15,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 642 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:52:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49909 states. [2025-03-17 04:52:17,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49909 to 49909. [2025-03-17 04:52:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49909 states, 45276 states have (on average 1.575735489000795) internal successors, (71343), 45600 states have internal predecessors, (71343), 4291 states have call successors, (4291), 341 states have call predecessors, (4291), 341 states have return successors, (4291), 3967 states have call predecessors, (4291), 4291 states have call successors, (4291) [2025-03-17 04:52:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49909 states to 49909 states and 79925 transitions. [2025-03-17 04:52:17,313 INFO L78 Accepts]: Start accepts. Automaton has 49909 states and 79925 transitions. Word has length 453 [2025-03-17 04:52:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:52:17,314 INFO L471 AbstractCegarLoop]: Abstraction has 49909 states and 79925 transitions. [2025-03-17 04:52:17,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:52:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 49909 states and 79925 transitions. [2025-03-17 04:52:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:52:17,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:52:17,336 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:52:17,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:52:17,336 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:52:17,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:52:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1866107966, now seen corresponding path program 1 times [2025-03-17 04:52:17,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:52:17,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221405625] [2025-03-17 04:52:17,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:52:17,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:52:18,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:52:18,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:18,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:52:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:52:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221405625] [2025-03-17 04:52:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221405625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:52:18,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:52:18,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:52:18,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878472710] [2025-03-17 04:52:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:52:18,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:52:18,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:52:18,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:52:18,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:52:18,453 INFO L87 Difference]: Start difference. First operand 49909 states and 79925 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:52:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:52:19,742 INFO L93 Difference]: Finished difference Result 101237 states and 162523 transitions. [2025-03-17 04:52:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:52:19,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 453 [2025-03-17 04:52:19,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:52:19,959 INFO L225 Difference]: With dead ends: 101237 [2025-03-17 04:52:19,959 INFO L226 Difference]: Without dead ends: 55995 [2025-03-17 04:52:20,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:52:20,002 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 337 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:52:20,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1708 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:52:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55995 states. [2025-03-17 04:52:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55995 to 42361. [2025-03-17 04:52:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42361 states, 39912 states have (on average 1.5833583884546) internal successors, (63195), 40092 states have internal predecessors, (63195), 2239 states have call successors, (2239), 209 states have call predecessors, (2239), 209 states have return successors, (2239), 2059 states have call predecessors, (2239), 2239 states have call successors, (2239) [2025-03-17 04:52:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42361 states to 42361 states and 67673 transitions. [2025-03-17 04:52:21,604 INFO L78 Accepts]: Start accepts. Automaton has 42361 states and 67673 transitions. Word has length 453 [2025-03-17 04:52:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:52:21,605 INFO L471 AbstractCegarLoop]: Abstraction has 42361 states and 67673 transitions. [2025-03-17 04:52:21,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-03-17 04:52:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42361 states and 67673 transitions. [2025-03-17 04:52:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 04:52:21,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:52:21,636 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:52:21,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 04:52:21,636 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:52:21,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:52:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1611371421, now seen corresponding path program 1 times [2025-03-17 04:52:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:52:21,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801051189] [2025-03-17 04:52:21,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:52:21,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:52:25,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:52:25,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:25,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 6 proven. 192 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-17 04:52:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:52:25,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801051189] [2025-03-17 04:52:25,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801051189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:52:25,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111391493] [2025-03-17 04:52:25,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:25,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:52:25,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:52:25,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:52:25,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:52:25,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 04:52:25,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 04:52:25,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:25,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:25,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:52:25,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:52:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4416 proven. 111 refuted. 0 times theorem prover too weak. 4317 trivial. 0 not checked. [2025-03-17 04:52:26,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:52:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 87 proven. 111 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-17 04:52:26,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111391493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:52:26,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:52:26,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 04:52:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043325904] [2025-03-17 04:52:26,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:52:26,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:52:26,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:52:26,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:52:26,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:52:26,496 INFO L87 Difference]: Start difference. First operand 42361 states and 67673 transitions. Second operand has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) [2025-03-17 04:52:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:52:27,947 INFO L93 Difference]: Finished difference Result 65285 states and 104098 transitions. [2025-03-17 04:52:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 04:52:27,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) Word has length 453 [2025-03-17 04:52:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:52:28,029 INFO L225 Difference]: With dead ends: 65285 [2025-03-17 04:52:28,029 INFO L226 Difference]: Without dead ends: 23165 [2025-03-17 04:52:28,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 903 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-17 04:52:28,072 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 868 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:52:28,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 692 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:52:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23165 states. [2025-03-17 04:52:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23165 to 22941. [2025-03-17 04:52:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22941 states, 20910 states have (on average 1.52831181252989) internal successors, (31957), 20994 states have internal predecessors, (31957), 1855 states have call successors, (1855), 175 states have call predecessors, (1855), 175 states have return successors, (1855), 1771 states have call predecessors, (1855), 1855 states have call successors, (1855) [2025-03-17 04:52:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22941 states to 22941 states and 35667 transitions. [2025-03-17 04:52:29,239 INFO L78 Accepts]: Start accepts. Automaton has 22941 states and 35667 transitions. Word has length 453 [2025-03-17 04:52:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:52:29,240 INFO L471 AbstractCegarLoop]: Abstraction has 22941 states and 35667 transitions. [2025-03-17 04:52:29,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.125) internal successors, (185), 8 states have internal predecessors, (185), 3 states have call successors, (168), 2 states have call predecessors, (168), 4 states have return successors, (170), 3 states have call predecessors, (170), 3 states have call successors, (170) [2025-03-17 04:52:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 22941 states and 35667 transitions. [2025-03-17 04:52:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 04:52:29,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:52:29,252 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:52:29,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:52:29,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 04:52:29,457 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:52:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:52:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1921943197, now seen corresponding path program 1 times [2025-03-17 04:52:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:52:29,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654597934] [2025-03-17 04:52:29,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:29,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:52:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 04:52:29,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 04:52:29,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:29,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:52:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:52:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654597934] [2025-03-17 04:52:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654597934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:52:31,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:52:31,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:52:31,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059954312] [2025-03-17 04:52:31,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:52:31,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:52:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:52:31,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:52:31,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:52:31,215 INFO L87 Difference]: Start difference. First operand 22941 states and 35667 transitions. Second operand has 10 states, 9 states have (on average 13.666666666666666) internal successors, (123), 10 states have internal predecessors, (123), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-17 04:52:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:52:33,978 INFO L93 Difference]: Finished difference Result 55139 states and 85819 transitions. [2025-03-17 04:52:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:52:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.666666666666666) internal successors, (123), 10 states have internal predecessors, (123), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) Word has length 455 [2025-03-17 04:52:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:52:34,054 INFO L225 Difference]: With dead ends: 55139 [2025-03-17 04:52:34,054 INFO L226 Difference]: Without dead ends: 32597 [2025-03-17 04:52:34,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 04:52:34,084 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 914 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:52:34,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 2654 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 04:52:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32597 states. [2025-03-17 04:52:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32597 to 27327. [2025-03-17 04:52:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27327 states, 25296 states have (on average 1.5354601518026565) internal successors, (38841), 25380 states have internal predecessors, (38841), 1855 states have call successors, (1855), 175 states have call predecessors, (1855), 175 states have return successors, (1855), 1771 states have call predecessors, (1855), 1855 states have call successors, (1855) [2025-03-17 04:52:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27327 states to 27327 states and 42551 transitions. [2025-03-17 04:52:35,212 INFO L78 Accepts]: Start accepts. Automaton has 27327 states and 42551 transitions. Word has length 455 [2025-03-17 04:52:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:52:35,213 INFO L471 AbstractCegarLoop]: Abstraction has 27327 states and 42551 transitions. [2025-03-17 04:52:35,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.666666666666666) internal successors, (123), 10 states have internal predecessors, (123), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-17 04:52:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 27327 states and 42551 transitions. [2025-03-17 04:52:35,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 04:52:35,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:52:35,231 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:52:35,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 04:52:35,232 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:52:35,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:52:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1505971874, now seen corresponding path program 1 times [2025-03-17 04:52:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:52:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418459809] [2025-03-17 04:52:35,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:52:35,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 04:52:35,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 04:52:35,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:35,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-03-17 04:52:36,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:52:36,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418459809] [2025-03-17 04:52:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418459809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:52:36,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:52:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:52:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562351701] [2025-03-17 04:52:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:52:36,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:52:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:52:36,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:52:36,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:52:36,321 INFO L87 Difference]: Start difference. First operand 27327 states and 42551 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-17 04:52:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:52:37,655 INFO L93 Difference]: Finished difference Result 69383 states and 107541 transitions. [2025-03-17 04:52:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:52:37,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 455 [2025-03-17 04:52:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:52:37,757 INFO L225 Difference]: With dead ends: 69383 [2025-03-17 04:52:37,757 INFO L226 Difference]: Without dead ends: 48905 [2025-03-17 04:52:37,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:52:37,794 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 531 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:52:37,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 897 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:52:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48905 states. [2025-03-17 04:52:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48905 to 47431. [2025-03-17 04:52:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47431 states, 44872 states have (on average 1.5346986985202353) internal successors, (68865), 45052 states have internal predecessors, (68865), 2239 states have call successors, (2239), 319 states have call predecessors, (2239), 319 states have return successors, (2239), 2059 states have call predecessors, (2239), 2239 states have call successors, (2239) [2025-03-17 04:52:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47431 states to 47431 states and 73343 transitions. [2025-03-17 04:52:39,413 INFO L78 Accepts]: Start accepts. Automaton has 47431 states and 73343 transitions. Word has length 455 [2025-03-17 04:52:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:52:39,413 INFO L471 AbstractCegarLoop]: Abstraction has 47431 states and 73343 transitions. [2025-03-17 04:52:39,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 2 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-17 04:52:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 47431 states and 73343 transitions. [2025-03-17 04:52:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 04:52:39,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:52:39,451 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:52:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 04:52:39,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:52:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:52:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1944523551, now seen corresponding path program 1 times [2025-03-17 04:52:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:52:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664772433] [2025-03-17 04:52:39,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:52:39,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 04:52:43,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 04:52:43,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:52:43,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:52:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 18 proven. 180 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-17 04:52:43,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:52:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664772433] [2025-03-17 04:52:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664772433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:52:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700199919] [2025-03-17 04:52:43,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:52:43,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:52:43,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:52:43,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:52:43,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:52:43,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes.