./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.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_fillercode_fillercodestructure_filler-ps-co_file-3.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 7ff62df6f9603281bf0e236ab8865fc937b3dc90e8a1704cf1768013825b0923 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:18:50,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:18:50,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:18:50,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:18:50,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:18:50,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:18:50,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:18:50,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:18:50,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:18:50,232 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:18:50,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:18:50,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:18:50,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:18:50,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:18:50,233 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:18:50,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:18:50,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:18:50,234 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:18:50,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:18:50,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:18:50,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:18:50,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:18:50,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:18:50,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:18:50,235 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:18:50,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:18:50,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:18:50,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:18:50,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:18:50,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:18:50,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:18:50,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:18:50,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:18:50,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:18:50,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:18:50,237 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 -> 7ff62df6f9603281bf0e236ab8865fc937b3dc90e8a1704cf1768013825b0923 [2025-03-17 02:18:50,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:18:50,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:18:50,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:18:50,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:18:50,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:18:50,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-03-17 02:18:52,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7834620a/644a5929159a402d93ecd2d603c755a1/FLAG9d96389ea [2025-03-17 02:18:52,380 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:18:52,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-03-17 02:18:52,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7834620a/644a5929159a402d93ecd2d603c755a1/FLAG9d96389ea [2025-03-17 02:18:52,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7834620a/644a5929159a402d93ecd2d603c755a1 [2025-03-17 02:18:52,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:18:52,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:18:52,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:18:52,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:18:52,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:18:52,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b281dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52, skipping insertion in model container [2025-03-17 02:18:52,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:18:52,615 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_fillercode_fillercodestructure_filler-ps-co_file-3.i[918,931] [2025-03-17 02:18:52,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:18:52,708 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:18:52,715 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_fillercode_fillercodestructure_filler-ps-co_file-3.i[918,931] [2025-03-17 02:18:52,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:18:52,770 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:18:52,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52 WrapperNode [2025-03-17 02:18:52,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:18:52,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:18:52,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:18:52,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:18:52,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,848 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-03-17 02:18:52,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:18:52,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:18:52,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:18:52,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:18:52,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,890 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 02:18:52,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:18:52,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:18:52,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:18:52,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:18:52,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (1/1) ... [2025-03-17 02:18:52,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:18:52,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:18:52,956 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 02:18:52,973 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 02:18:52,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:18:52,999 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:18:53,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:18:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:18:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:18:53,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:18:53,101 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:18:53,104 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:18:53,705 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-03-17 02:18:53,745 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 02:18:53,745 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:18:53,771 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:18:53,773 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 02:18:53,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:18:53 BoogieIcfgContainer [2025-03-17 02:18:53,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:18:53,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:18:53,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:18:53,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:18:53,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:18:52" (1/3) ... [2025-03-17 02:18:53,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fa2526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:18:53, skipping insertion in model container [2025-03-17 02:18:53,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:18:52" (2/3) ... [2025-03-17 02:18:53,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79fa2526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:18:53, skipping insertion in model container [2025-03-17 02:18:53,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:18:53" (3/3) ... [2025-03-17 02:18:53,785 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-03-17 02:18:53,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:18:53,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:18:53,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:18:53,864 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;@700a2561, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:18:53,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:18:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 82 states have internal predecessors, (124), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 02:18:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-17 02:18:53,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:18:53,881 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:18:53,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:18:53,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:18:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1406769505, now seen corresponding path program 1 times [2025-03-17 02:18:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:18:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432954225] [2025-03-17 02:18:53,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:53,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:18:54,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-17 02:18:54,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 02:18:54,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:54,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 02:18:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:18:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432954225] [2025-03-17 02:18:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432954225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:18:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801729890] [2025-03-17 02:18:54,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:54,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:18:54,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:18:54,319 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 02:18:54,321 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 02:18:54,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-17 02:18:54,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 02:18:54,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:54,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:54,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:18:54,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:18:54,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 02:18:54,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:18:54,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801729890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:18:54,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:18:54,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:18:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713536840] [2025-03-17 02:18:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:18:54,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:18:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:18:54,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:18:54,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:18:54,638 INFO L87 Difference]: Start difference. First operand has 118 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 82 states have internal predecessors, (124), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:18:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:18:54,684 INFO L93 Difference]: Finished difference Result 233 states and 416 transitions. [2025-03-17 02:18:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:18:54,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 218 [2025-03-17 02:18:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:18:54,693 INFO L225 Difference]: With dead ends: 233 [2025-03-17 02:18:54,694 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 02:18:54,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 219 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 02:18:54,702 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:18:54,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:18:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 02:18:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 02:18:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.4875) internal successors, (119), 80 states have internal predecessors, (119), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 02:18:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 187 transitions. [2025-03-17 02:18:54,747 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 187 transitions. Word has length 218 [2025-03-17 02:18:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:18:54,747 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 187 transitions. [2025-03-17 02:18:54,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:18:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 187 transitions. [2025-03-17 02:18:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-17 02:18:54,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:18:54,752 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:18:54,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:18:54,953 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 02:18:54,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:18:54,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:18:54,954 INFO L85 PathProgramCache]: Analyzing trace with hash -304989947, now seen corresponding path program 1 times [2025-03-17 02:18:54,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:18:54,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602342539] [2025-03-17 02:18:54,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:54,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:18:54,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-17 02:18:55,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-17 02:18:55,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:55,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:18:55,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:18:55,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602342539] [2025-03-17 02:18:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602342539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:18:55,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:18:55,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:18:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444977336] [2025-03-17 02:18:55,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:18:55,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:18:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:18:55,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:18:55,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:18:55,490 INFO L87 Difference]: Start difference. First operand 116 states and 187 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:18:55,726 INFO L93 Difference]: Finished difference Result 347 states and 561 transitions. [2025-03-17 02:18:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:18:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-17 02:18:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:18:55,735 INFO L225 Difference]: With dead ends: 347 [2025-03-17 02:18:55,735 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 02:18:55,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 02:18:55,737 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 127 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:18:55,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 451 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:18:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 02:18:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2025-03-17 02:18:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 158 states have (on average 1.4873417721518987) internal successors, (235), 158 states have internal predecessors, (235), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 02:18:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 371 transitions. [2025-03-17 02:18:55,777 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 371 transitions. Word has length 218 [2025-03-17 02:18:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:18:55,778 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 371 transitions. [2025-03-17 02:18:55,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 371 transitions. [2025-03-17 02:18:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-17 02:18:55,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:18:55,787 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:18:55,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:18:55,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:18:55,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:18:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1467031457, now seen corresponding path program 1 times [2025-03-17 02:18:55,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:18:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677568175] [2025-03-17 02:18:55,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:18:55,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-17 02:18:55,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-17 02:18:55,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:55,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:18:56,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:18:56,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677568175] [2025-03-17 02:18:56,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677568175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:18:56,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:18:56,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:18:56,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954076927] [2025-03-17 02:18:56,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:18:56,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:18:56,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:18:56,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:18:56,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:18:56,158 INFO L87 Difference]: Start difference. First operand 229 states and 371 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:18:56,260 INFO L93 Difference]: Finished difference Result 685 states and 1111 transitions. [2025-03-17 02:18:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:18:56,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-17 02:18:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:18:56,266 INFO L225 Difference]: With dead ends: 685 [2025-03-17 02:18:56,266 INFO L226 Difference]: Without dead ends: 457 [2025-03-17 02:18:56,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:18:56,268 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 108 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:18:56,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 351 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:18:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-17 02:18:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2025-03-17 02:18:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 314 states have (on average 1.464968152866242) internal successors, (460), 314 states have internal predecessors, (460), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 02:18:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 732 transitions. [2025-03-17 02:18:56,368 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 732 transitions. Word has length 219 [2025-03-17 02:18:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:18:56,371 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 732 transitions. [2025-03-17 02:18:56,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 732 transitions. [2025-03-17 02:18:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-17 02:18:56,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:18:56,377 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:18:56,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:18:56,378 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:18:56,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:18:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2041336791, now seen corresponding path program 1 times [2025-03-17 02:18:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:18:56,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751316227] [2025-03-17 02:18:56,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:56,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:18:56,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-17 02:18:56,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-17 02:18:56,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:56,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:18:56,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:18:56,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751316227] [2025-03-17 02:18:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751316227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:18:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:18:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:18:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546274855] [2025-03-17 02:18:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:18:56,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:18:56,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:18:56,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:18:56,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:18:56,547 INFO L87 Difference]: Start difference. First operand 455 states and 732 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:18:56,639 INFO L93 Difference]: Finished difference Result 1031 states and 1648 transitions. [2025-03-17 02:18:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:18:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2025-03-17 02:18:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:18:56,648 INFO L225 Difference]: With dead ends: 1031 [2025-03-17 02:18:56,648 INFO L226 Difference]: Without dead ends: 577 [2025-03-17 02:18:56,651 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 02:18:56,652 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 40 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:18:56,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 378 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:18:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-17 02:18:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 491. [2025-03-17 02:18:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 350 states have (on average 1.4628571428571429) internal successors, (512), 350 states have internal predecessors, (512), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-17 02:18:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 784 transitions. [2025-03-17 02:18:56,719 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 784 transitions. Word has length 220 [2025-03-17 02:18:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:18:56,720 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 784 transitions. [2025-03-17 02:18:56,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 784 transitions. [2025-03-17 02:18:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-17 02:18:56,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:18:56,724 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:18:56,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:18:56,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:18:56,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:18:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2107865898, now seen corresponding path program 1 times [2025-03-17 02:18:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:18:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821926447] [2025-03-17 02:18:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:18:56,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-17 02:18:56,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-17 02:18:56,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:56,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:18:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:18:56,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821926447] [2025-03-17 02:18:56,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821926447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:18:56,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:18:56,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:18:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299194366] [2025-03-17 02:18:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:18:56,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:18:56,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:18:56,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:18:56,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:18:56,910 INFO L87 Difference]: Start difference. First operand 491 states and 784 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:18:57,058 INFO L93 Difference]: Finished difference Result 1443 states and 2312 transitions. [2025-03-17 02:18:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:18:57,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2025-03-17 02:18:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:18:57,067 INFO L225 Difference]: With dead ends: 1443 [2025-03-17 02:18:57,067 INFO L226 Difference]: Without dead ends: 953 [2025-03-17 02:18:57,070 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 02:18:57,071 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 168 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:18:57,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 451 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:18:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-17 02:18:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 951. [2025-03-17 02:18:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 670 states have (on average 1.4447761194029851) internal successors, (968), 670 states have internal predecessors, (968), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-17 02:18:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1512 transitions. [2025-03-17 02:18:57,234 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1512 transitions. Word has length 220 [2025-03-17 02:18:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:18:57,239 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1512 transitions. [2025-03-17 02:18:57,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1512 transitions. [2025-03-17 02:18:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-17 02:18:57,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:18:57,246 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:18:57,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:18:57,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:18:57,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:18:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash 979723618, now seen corresponding path program 1 times [2025-03-17 02:18:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:18:57,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388173871] [2025-03-17 02:18:57,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:18:57,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-17 02:18:57,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-17 02:18:57,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:57,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:18:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:18:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388173871] [2025-03-17 02:18:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388173871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:18:57,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:18:57,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:18:57,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185295750] [2025-03-17 02:18:57,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:18:57,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:18:57,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:18:57,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:18:57,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:18:57,543 INFO L87 Difference]: Start difference. First operand 951 states and 1512 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:18:58,244 INFO L93 Difference]: Finished difference Result 3803 states and 6058 transitions. [2025-03-17 02:18:58,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:18:58,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2025-03-17 02:18:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:18:58,263 INFO L225 Difference]: With dead ends: 3803 [2025-03-17 02:18:58,264 INFO L226 Difference]: Without dead ends: 2853 [2025-03-17 02:18:58,269 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 02:18:58,270 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 484 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:18:58,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 354 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:18:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2025-03-17 02:18:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1899. [2025-03-17 02:18:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1338 states have (on average 1.4394618834080717) internal successors, (1926), 1338 states have internal predecessors, (1926), 544 states have call successors, (544), 16 states have call predecessors, (544), 16 states have return successors, (544), 544 states have call predecessors, (544), 544 states have call successors, (544) [2025-03-17 02:18:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 3014 transitions. [2025-03-17 02:18:58,489 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 3014 transitions. Word has length 221 [2025-03-17 02:18:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:18:58,489 INFO L471 AbstractCegarLoop]: Abstraction has 1899 states and 3014 transitions. [2025-03-17 02:18:58,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 3014 transitions. [2025-03-17 02:18:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-17 02:18:58,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:18:58,493 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:18:58,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:18:58,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:18:58,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:18:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1598197888, now seen corresponding path program 1 times [2025-03-17 02:18:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:18:58,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918745565] [2025-03-17 02:18:58,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:58,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:18:58,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-17 02:18:58,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-17 02:18:58,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:58,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:18:58,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:18:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918745565] [2025-03-17 02:18:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918745565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:18:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:18:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:18:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721783608] [2025-03-17 02:18:58,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:18:58,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:18:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:18:58,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:18:58,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:18:58,741 INFO L87 Difference]: Start difference. First operand 1899 states and 3014 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:18:59,132 INFO L93 Difference]: Finished difference Result 5695 states and 9040 transitions. [2025-03-17 02:18:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:18:59,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-03-17 02:18:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:18:59,167 INFO L225 Difference]: With dead ends: 5695 [2025-03-17 02:18:59,167 INFO L226 Difference]: Without dead ends: 3797 [2025-03-17 02:18:59,177 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 02:18:59,178 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 128 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:18:59,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 337 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:18:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2025-03-17 02:18:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3779. [2025-03-17 02:18:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 2658 states have (on average 1.436418359668924) internal successors, (3818), 2658 states have internal predecessors, (3818), 1088 states have call successors, (1088), 32 states have call predecessors, (1088), 32 states have return successors, (1088), 1088 states have call predecessors, (1088), 1088 states have call successors, (1088) [2025-03-17 02:18:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 5994 transitions. [2025-03-17 02:18:59,625 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 5994 transitions. Word has length 222 [2025-03-17 02:18:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:18:59,626 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 5994 transitions. [2025-03-17 02:18:59,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:18:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 5994 transitions. [2025-03-17 02:18:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-17 02:18:59,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:18:59,637 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:18:59,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:18:59,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:18:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:18:59,637 INFO L85 PathProgramCache]: Analyzing trace with hash -33466779, now seen corresponding path program 1 times [2025-03-17 02:18:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:18:59,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429612002] [2025-03-17 02:18:59,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:18:59,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:18:59,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-17 02:18:59,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-17 02:18:59,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:18:59,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:18:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:18:59,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:18:59,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429612002] [2025-03-17 02:18:59,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429612002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:18:59,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:18:59,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:18:59,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517203600] [2025-03-17 02:18:59,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:18:59,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:18:59,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:18:59,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:18:59,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:18:59,819 INFO L87 Difference]: Start difference. First operand 3779 states and 5994 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:00,341 INFO L93 Difference]: Finished difference Result 9495 states and 15084 transitions. [2025-03-17 02:19:00,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:19:00,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-03-17 02:19:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:00,377 INFO L225 Difference]: With dead ends: 9495 [2025-03-17 02:19:00,377 INFO L226 Difference]: Without dead ends: 5717 [2025-03-17 02:19:00,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:19:00,391 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 122 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:00,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 353 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:19:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5717 states. [2025-03-17 02:19:00,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5717 to 5715. [2025-03-17 02:19:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5715 states, 4034 states have (on average 1.4283589489340605) internal successors, (5762), 4034 states have internal predecessors, (5762), 1632 states have call successors, (1632), 48 states have call predecessors, (1632), 48 states have return successors, (1632), 1632 states have call predecessors, (1632), 1632 states have call successors, (1632) [2025-03-17 02:19:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5715 states to 5715 states and 9026 transitions. [2025-03-17 02:19:00,862 INFO L78 Accepts]: Start accepts. Automaton has 5715 states and 9026 transitions. Word has length 223 [2025-03-17 02:19:00,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:00,863 INFO L471 AbstractCegarLoop]: Abstraction has 5715 states and 9026 transitions. [2025-03-17 02:19:00,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5715 states and 9026 transitions. [2025-03-17 02:19:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-17 02:19:00,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:00,866 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:00,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:19:00,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:00,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 399026701, now seen corresponding path program 1 times [2025-03-17 02:19:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370934126] [2025-03-17 02:19:00,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:00,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-17 02:19:00,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-17 02:19:00,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:00,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:00,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:00,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370934126] [2025-03-17 02:19:00,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370934126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:00,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:00,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:19:00,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021437262] [2025-03-17 02:19:00,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:00,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:19:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:00,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:19:00,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:19:00,987 INFO L87 Difference]: Start difference. First operand 5715 states and 9026 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:01,488 INFO L93 Difference]: Finished difference Result 11455 states and 18100 transitions. [2025-03-17 02:19:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:19:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-03-17 02:19:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:01,533 INFO L225 Difference]: With dead ends: 11455 [2025-03-17 02:19:01,534 INFO L226 Difference]: Without dead ends: 5741 [2025-03-17 02:19:01,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:19:01,560 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 122 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:01,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 452 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:19:01,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2025-03-17 02:19:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5715. [2025-03-17 02:19:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5715 states, 4034 states have (on average 1.4243926623698562) internal successors, (5746), 4034 states have internal predecessors, (5746), 1632 states have call successors, (1632), 48 states have call predecessors, (1632), 48 states have return successors, (1632), 1632 states have call predecessors, (1632), 1632 states have call successors, (1632) [2025-03-17 02:19:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5715 states to 5715 states and 9010 transitions. [2025-03-17 02:19:02,024 INFO L78 Accepts]: Start accepts. Automaton has 5715 states and 9010 transitions. Word has length 224 [2025-03-17 02:19:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:02,029 INFO L471 AbstractCegarLoop]: Abstraction has 5715 states and 9010 transitions. [2025-03-17 02:19:02,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 5715 states and 9010 transitions. [2025-03-17 02:19:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-17 02:19:02,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:02,031 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:02,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:19:02,032 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:02,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash -784230275, now seen corresponding path program 1 times [2025-03-17 02:19:02,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:02,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444114331] [2025-03-17 02:19:02,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:02,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-17 02:19:02,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-17 02:19:02,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:02,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:02,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444114331] [2025-03-17 02:19:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444114331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:02,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:02,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:19:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595904852] [2025-03-17 02:19:02,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:02,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:19:02,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:02,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:19:02,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:19:02,446 INFO L87 Difference]: Start difference. First operand 5715 states and 9010 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:03,026 INFO L93 Difference]: Finished difference Result 12865 states and 20266 transitions. [2025-03-17 02:19:03,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:19:03,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 225 [2025-03-17 02:19:03,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:03,115 INFO L225 Difference]: With dead ends: 12865 [2025-03-17 02:19:03,116 INFO L226 Difference]: Without dead ends: 7151 [2025-03-17 02:19:03,144 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 02:19:03,145 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 128 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:03,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 487 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:19:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2025-03-17 02:19:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 7137. [2025-03-17 02:19:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7137 states, 5036 states have (on average 1.420174741858618) internal successors, (7152), 5036 states have internal predecessors, (7152), 2040 states have call successors, (2040), 60 states have call predecessors, (2040), 60 states have return successors, (2040), 2040 states have call predecessors, (2040), 2040 states have call successors, (2040) [2025-03-17 02:19:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 11232 transitions. [2025-03-17 02:19:03,751 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 11232 transitions. Word has length 225 [2025-03-17 02:19:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:03,752 INFO L471 AbstractCegarLoop]: Abstraction has 7137 states and 11232 transitions. [2025-03-17 02:19:03,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 11232 transitions. [2025-03-17 02:19:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-17 02:19:03,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:03,756 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:03,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:19:03,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:03,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1624522692, now seen corresponding path program 1 times [2025-03-17 02:19:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:03,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356260207] [2025-03-17 02:19:03,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:03,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:03,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 02:19:03,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 02:19:03,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:03,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:04,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:04,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356260207] [2025-03-17 02:19:04,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356260207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:04,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:04,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:19:04,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650521237] [2025-03-17 02:19:04,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:04,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:19:04,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:04,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:19:04,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:19:04,217 INFO L87 Difference]: Start difference. First operand 7137 states and 11232 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:06,132 INFO L93 Difference]: Finished difference Result 23421 states and 36905 transitions. [2025-03-17 02:19:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:19:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226 [2025-03-17 02:19:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:06,251 INFO L225 Difference]: With dead ends: 23421 [2025-03-17 02:19:06,251 INFO L226 Difference]: Without dead ends: 16285 [2025-03-17 02:19:06,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:19:06,294 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 534 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:06,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 647 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 02:19:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16285 states. [2025-03-17 02:19:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16285 to 10509. [2025-03-17 02:19:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10509 states, 7554 states have (on average 1.4291765951813609) internal successors, (10796), 7596 states have internal predecessors, (10796), 2854 states have call successors, (2854), 100 states have call predecessors, (2854), 100 states have return successors, (2854), 2812 states have call predecessors, (2854), 2854 states have call successors, (2854) [2025-03-17 02:19:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10509 states to 10509 states and 16504 transitions. [2025-03-17 02:19:07,367 INFO L78 Accepts]: Start accepts. Automaton has 10509 states and 16504 transitions. Word has length 226 [2025-03-17 02:19:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:07,368 INFO L471 AbstractCegarLoop]: Abstraction has 10509 states and 16504 transitions. [2025-03-17 02:19:07,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10509 states and 16504 transitions. [2025-03-17 02:19:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-17 02:19:07,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:07,374 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:07,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:19:07,375 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:07,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash -452686651, now seen corresponding path program 1 times [2025-03-17 02:19:07,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:07,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080178656] [2025-03-17 02:19:07,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:07,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 02:19:07,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 02:19:07,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:07,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:07,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:07,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080178656] [2025-03-17 02:19:07,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080178656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:07,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:07,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:19:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985855305] [2025-03-17 02:19:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:07,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:19:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:07,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:19:07,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:19:07,868 INFO L87 Difference]: Start difference. First operand 10509 states and 16504 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:19:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:10,073 INFO L93 Difference]: Finished difference Result 30429 states and 47719 transitions. [2025-03-17 02:19:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:19:10,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 226 [2025-03-17 02:19:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:10,193 INFO L225 Difference]: With dead ends: 30429 [2025-03-17 02:19:10,194 INFO L226 Difference]: Without dead ends: 19921 [2025-03-17 02:19:10,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:19:10,251 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 468 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:10,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 696 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 02:19:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19921 states. [2025-03-17 02:19:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19921 to 19821. [2025-03-17 02:19:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19821 states, 14244 states have (on average 1.426144341477113) internal successors, (20314), 14332 states have internal predecessors, (20314), 5384 states have call successors, (5384), 192 states have call predecessors, (5384), 192 states have return successors, (5384), 5296 states have call predecessors, (5384), 5384 states have call successors, (5384) [2025-03-17 02:19:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19821 states to 19821 states and 31082 transitions. [2025-03-17 02:19:12,161 INFO L78 Accepts]: Start accepts. Automaton has 19821 states and 31082 transitions. Word has length 226 [2025-03-17 02:19:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:12,163 INFO L471 AbstractCegarLoop]: Abstraction has 19821 states and 31082 transitions. [2025-03-17 02:19:12,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:19:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19821 states and 31082 transitions. [2025-03-17 02:19:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-17 02:19:12,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:12,169 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:12,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:19:12,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:12,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1329504314, now seen corresponding path program 1 times [2025-03-17 02:19:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:12,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66883839] [2025-03-17 02:19:12,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:12,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 02:19:12,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 02:19:12,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:12,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-17 02:19:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66883839] [2025-03-17 02:19:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66883839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:19:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490250098] [2025-03-17 02:19:12,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:12,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:19:12,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:19:12,502 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 02:19:12,505 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 02:19:12,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 02:19:12,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 02:19:12,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:12,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:12,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 02:19:12,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:19:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-03-17 02:19:12,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:19:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-17 02:19:13,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490250098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:19:13,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:19:13,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 02:19:13,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934987048] [2025-03-17 02:19:13,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:19:13,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:19:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:13,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:19:13,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:19:13,269 INFO L87 Difference]: Start difference. First operand 19821 states and 31082 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-17 02:19:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:15,187 INFO L93 Difference]: Finished difference Result 37313 states and 57656 transitions. [2025-03-17 02:19:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:19:15,187 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 226 [2025-03-17 02:19:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:15,318 INFO L225 Difference]: With dead ends: 37313 [2025-03-17 02:19:15,319 INFO L226 Difference]: Without dead ends: 17493 [2025-03-17 02:19:15,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:19:15,387 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 511 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:15,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 529 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:19:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17493 states. [2025-03-17 02:19:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17493 to 16081. [2025-03-17 02:19:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16081 states, 11534 states have (on average 1.4024622854170279) internal successors, (16176), 11568 states have internal predecessors, (16176), 4250 states have call successors, (4250), 296 states have call predecessors, (4250), 296 states have return successors, (4250), 4216 states have call predecessors, (4250), 4250 states have call successors, (4250) [2025-03-17 02:19:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16081 states to 16081 states and 24676 transitions. [2025-03-17 02:19:17,382 INFO L78 Accepts]: Start accepts. Automaton has 16081 states and 24676 transitions. Word has length 226 [2025-03-17 02:19:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:17,385 INFO L471 AbstractCegarLoop]: Abstraction has 16081 states and 24676 transitions. [2025-03-17 02:19:17,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-03-17 02:19:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 16081 states and 24676 transitions. [2025-03-17 02:19:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-17 02:19:17,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:17,389 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:17,399 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 02:19:17,590 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,SelfDestructingSolverStorable12 [2025-03-17 02:19:17,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:17,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1668974631, now seen corresponding path program 1 times [2025-03-17 02:19:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:17,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496419223] [2025-03-17 02:19:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:17,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 02:19:17,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 02:19:17,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:17,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496419223] [2025-03-17 02:19:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496419223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:17,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:17,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:19:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555993488] [2025-03-17 02:19:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:17,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:19:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:17,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:19:17,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:19:17,960 INFO L87 Difference]: Start difference. First operand 16081 states and 24676 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:19,240 INFO L93 Difference]: Finished difference Result 32734 states and 50250 transitions. [2025-03-17 02:19:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:19:19,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 227 [2025-03-17 02:19:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:19,325 INFO L225 Difference]: With dead ends: 32734 [2025-03-17 02:19:19,325 INFO L226 Difference]: Without dead ends: 16654 [2025-03-17 02:19:19,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:19:19,368 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 242 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:19,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 623 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:19:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16654 states. [2025-03-17 02:19:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16654 to 16545. [2025-03-17 02:19:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16545 states, 11822 states have (on average 1.396717983420741) internal successors, (16512), 11864 states have internal predecessors, (16512), 4418 states have call successors, (4418), 304 states have call predecessors, (4418), 304 states have return successors, (4418), 4376 states have call predecessors, (4418), 4418 states have call successors, (4418) [2025-03-17 02:19:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16545 states to 16545 states and 25348 transitions. [2025-03-17 02:19:20,555 INFO L78 Accepts]: Start accepts. Automaton has 16545 states and 25348 transitions. Word has length 227 [2025-03-17 02:19:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:20,556 INFO L471 AbstractCegarLoop]: Abstraction has 16545 states and 25348 transitions. [2025-03-17 02:19:20,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 16545 states and 25348 transitions. [2025-03-17 02:19:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-17 02:19:20,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:20,559 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:20,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 02:19:20,559 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:20,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:20,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1840106265, now seen corresponding path program 1 times [2025-03-17 02:19:20,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:20,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818045384] [2025-03-17 02:19:20,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:20,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 02:19:20,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 02:19:20,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:20,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-17 02:19:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818045384] [2025-03-17 02:19:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818045384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:19:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871443414] [2025-03-17 02:19:22,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:19:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:19:22,159 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 02:19:22,161 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 02:19:22,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-17 02:19:22,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-17 02:19:22,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:22,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:22,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 02:19:22,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:19:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1256 proven. 192 refuted. 0 times theorem prover too weak. 796 trivial. 0 not checked. [2025-03-17 02:19:23,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:19:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 87 proven. 201 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2025-03-17 02:19:25,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871443414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 02:19:25,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 02:19:25,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2025-03-17 02:19:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922130842] [2025-03-17 02:19:25,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 02:19:25,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 02:19:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:25,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 02:19:25,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-17 02:19:25,084 INFO L87 Difference]: Start difference. First operand 16545 states and 25348 transitions. Second operand has 25 states, 25 states have (on average 7.04) internal successors, (176), 25 states have internal predecessors, (176), 8 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (90), 8 states have call predecessors, (90), 8 states have call successors, (90) [2025-03-17 02:19:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:28,514 INFO L93 Difference]: Finished difference Result 30075 states and 44148 transitions. [2025-03-17 02:19:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 02:19:28,515 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.04) internal successors, (176), 25 states have internal predecessors, (176), 8 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (90), 8 states have call predecessors, (90), 8 states have call successors, (90) Word has length 228 [2025-03-17 02:19:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:28,605 INFO L225 Difference]: With dead ends: 30075 [2025-03-17 02:19:28,605 INFO L226 Difference]: Without dead ends: 16839 [2025-03-17 02:19:28,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=655, Invalid=1601, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 02:19:28,645 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 525 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:28,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 464 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 02:19:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16839 states. [2025-03-17 02:19:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16839 to 15399. [2025-03-17 02:19:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15399 states, 11314 states have (on average 1.3418773201343468) internal successors, (15182), 11416 states have internal predecessors, (15182), 3390 states have call successors, (3390), 694 states have call predecessors, (3390), 694 states have return successors, (3390), 3288 states have call predecessors, (3390), 3390 states have call successors, (3390) [2025-03-17 02:19:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15399 states to 15399 states and 21962 transitions. [2025-03-17 02:19:30,014 INFO L78 Accepts]: Start accepts. Automaton has 15399 states and 21962 transitions. Word has length 228 [2025-03-17 02:19:30,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:30,015 INFO L471 AbstractCegarLoop]: Abstraction has 15399 states and 21962 transitions. [2025-03-17 02:19:30,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.04) internal successors, (176), 25 states have internal predecessors, (176), 8 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (90), 8 states have call predecessors, (90), 8 states have call successors, (90) [2025-03-17 02:19:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 15399 states and 21962 transitions. [2025-03-17 02:19:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 02:19:30,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:30,018 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:30,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 02:19:30,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:19:30,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:30,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1258603463, now seen corresponding path program 1 times [2025-03-17 02:19:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:30,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498337052] [2025-03-17 02:19:30,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:30,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:30,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 02:19:30,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 02:19:30,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:30,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:30,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:30,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498337052] [2025-03-17 02:19:30,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498337052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:30,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:30,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:19:30,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428398478] [2025-03-17 02:19:30,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:30,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:19:30,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:30,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:19:30,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:19:30,426 INFO L87 Difference]: Start difference. First operand 15399 states and 21962 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:31,736 INFO L93 Difference]: Finished difference Result 27093 states and 38638 transitions. [2025-03-17 02:19:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:19:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 229 [2025-03-17 02:19:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:31,806 INFO L225 Difference]: With dead ends: 27093 [2025-03-17 02:19:31,807 INFO L226 Difference]: Without dead ends: 15451 [2025-03-17 02:19:31,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:19:31,833 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 107 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:31,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 716 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:19:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15451 states. [2025-03-17 02:19:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15451 to 11965. [2025-03-17 02:19:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11965 states, 8828 states have (on average 1.346624376982329) internal successors, (11888), 8902 states have internal predecessors, (11888), 2608 states have call successors, (2608), 528 states have call predecessors, (2608), 528 states have return successors, (2608), 2534 states have call predecessors, (2608), 2608 states have call successors, (2608) [2025-03-17 02:19:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11965 states to 11965 states and 17104 transitions. [2025-03-17 02:19:32,832 INFO L78 Accepts]: Start accepts. Automaton has 11965 states and 17104 transitions. Word has length 229 [2025-03-17 02:19:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:32,833 INFO L471 AbstractCegarLoop]: Abstraction has 11965 states and 17104 transitions. [2025-03-17 02:19:32,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 11965 states and 17104 transitions. [2025-03-17 02:19:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 02:19:32,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:32,835 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:32,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 02:19:32,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash -343049760, now seen corresponding path program 1 times [2025-03-17 02:19:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076421687] [2025-03-17 02:19:32,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:32,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 02:19:32,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 02:19:32,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:32,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:33,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:33,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076421687] [2025-03-17 02:19:33,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076421687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:33,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:33,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:19:33,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360551457] [2025-03-17 02:19:33,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:33,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:19:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:33,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:19:33,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:19:33,079 INFO L87 Difference]: Start difference. First operand 11965 states and 17104 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:19:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:35,212 INFO L93 Difference]: Finished difference Result 29753 states and 42649 transitions. [2025-03-17 02:19:35,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:19:35,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 229 [2025-03-17 02:19:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:35,307 INFO L225 Difference]: With dead ends: 29753 [2025-03-17 02:19:35,307 INFO L226 Difference]: Without dead ends: 23473 [2025-03-17 02:19:35,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:19:35,332 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 432 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:35,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 594 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:19:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23473 states. [2025-03-17 02:19:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23473 to 23445. [2025-03-17 02:19:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23445 states, 17306 states have (on average 1.3479718016872761) internal successors, (23328), 17460 states have internal predecessors, (23328), 5112 states have call successors, (5112), 1026 states have call predecessors, (5112), 1026 states have return successors, (5112), 4958 states have call predecessors, (5112), 5112 states have call successors, (5112) [2025-03-17 02:19:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23445 states to 23445 states and 33552 transitions. [2025-03-17 02:19:37,482 INFO L78 Accepts]: Start accepts. Automaton has 23445 states and 33552 transitions. Word has length 229 [2025-03-17 02:19:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:37,482 INFO L471 AbstractCegarLoop]: Abstraction has 23445 states and 33552 transitions. [2025-03-17 02:19:37,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:19:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 23445 states and 33552 transitions. [2025-03-17 02:19:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 02:19:37,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:37,484 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:37,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 02:19:37,484 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:37,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:37,485 INFO L85 PathProgramCache]: Analyzing trace with hash -613603033, now seen corresponding path program 1 times [2025-03-17 02:19:37,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:37,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178579584] [2025-03-17 02:19:37,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:37,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:37,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 02:19:37,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 02:19:37,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:37,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:37,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:37,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178579584] [2025-03-17 02:19:37,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178579584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:37,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:37,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:19:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885787617] [2025-03-17 02:19:37,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:37,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:19:37,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:37,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:19:37,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:19:37,667 INFO L87 Difference]: Start difference. First operand 23445 states and 33552 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:39,530 INFO L93 Difference]: Finished difference Result 49141 states and 70369 transitions. [2025-03-17 02:19:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:19:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 229 [2025-03-17 02:19:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:39,650 INFO L225 Difference]: With dead ends: 49141 [2025-03-17 02:19:39,650 INFO L226 Difference]: Without dead ends: 25697 [2025-03-17 02:19:39,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:19:39,704 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 283 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:39,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 667 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:19:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25697 states. [2025-03-17 02:19:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25697 to 24213. [2025-03-17 02:19:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24213 states, 18074 states have (on average 1.3555383423702556) internal successors, (24500), 18228 states have internal predecessors, (24500), 5112 states have call successors, (5112), 1026 states have call predecessors, (5112), 1026 states have return successors, (5112), 4958 states have call predecessors, (5112), 5112 states have call successors, (5112) [2025-03-17 02:19:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24213 states to 24213 states and 34724 transitions. [2025-03-17 02:19:42,628 INFO L78 Accepts]: Start accepts. Automaton has 24213 states and 34724 transitions. Word has length 229 [2025-03-17 02:19:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:42,629 INFO L471 AbstractCegarLoop]: Abstraction has 24213 states and 34724 transitions. [2025-03-17 02:19:42,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 02:19:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 24213 states and 34724 transitions. [2025-03-17 02:19:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 02:19:42,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:42,630 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:42,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 02:19:42,630 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:42,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash 746834104, now seen corresponding path program 1 times [2025-03-17 02:19:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:42,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571273942] [2025-03-17 02:19:42,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:42,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 02:19:42,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 02:19:42,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:42,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:43,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571273942] [2025-03-17 02:19:43,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571273942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:43,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:43,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:19:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081994806] [2025-03-17 02:19:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:43,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:19:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:43,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:19:43,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:19:43,083 INFO L87 Difference]: Start difference. First operand 24213 states and 34724 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:19:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:46,221 INFO L93 Difference]: Finished difference Result 48559 states and 69611 transitions. [2025-03-17 02:19:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 02:19:46,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 229 [2025-03-17 02:19:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:46,344 INFO L225 Difference]: With dead ends: 48559 [2025-03-17 02:19:46,344 INFO L226 Difference]: Without dead ends: 24347 [2025-03-17 02:19:46,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:19:46,404 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 516 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:46,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 821 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 02:19:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24347 states. [2025-03-17 02:19:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24347 to 24261. [2025-03-17 02:19:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24261 states, 18122 states have (on average 1.3532722657543317) internal successors, (24524), 18276 states have internal predecessors, (24524), 5112 states have call successors, (5112), 1026 states have call predecessors, (5112), 1026 states have return successors, (5112), 4958 states have call predecessors, (5112), 5112 states have call successors, (5112) [2025-03-17 02:19:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24261 states to 24261 states and 34748 transitions. [2025-03-17 02:19:48,549 INFO L78 Accepts]: Start accepts. Automaton has 24261 states and 34748 transitions. Word has length 229 [2025-03-17 02:19:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:48,550 INFO L471 AbstractCegarLoop]: Abstraction has 24261 states and 34748 transitions. [2025-03-17 02:19:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:19:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 24261 states and 34748 transitions. [2025-03-17 02:19:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 02:19:48,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:48,552 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:48,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 02:19:48,552 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:48,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:48,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1388314039, now seen corresponding path program 1 times [2025-03-17 02:19:48,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:48,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214426760] [2025-03-17 02:19:48,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:48,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:48,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 02:19:48,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 02:19:48,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214426760] [2025-03-17 02:19:48,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214426760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:48,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:48,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:19:48,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198455260] [2025-03-17 02:19:48,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:48,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:19:48,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:48,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:19:48,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:19:48,849 INFO L87 Difference]: Start difference. First operand 24261 states and 34748 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:19:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:19:53,486 INFO L93 Difference]: Finished difference Result 52571 states and 75074 transitions. [2025-03-17 02:19:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 02:19:53,486 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 230 [2025-03-17 02:19:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:19:53,592 INFO L225 Difference]: With dead ends: 52571 [2025-03-17 02:19:53,592 INFO L226 Difference]: Without dead ends: 28311 [2025-03-17 02:19:53,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:19:53,633 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 505 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:19:53,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1543 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 02:19:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28311 states. [2025-03-17 02:19:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28311 to 27167. [2025-03-17 02:19:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27167 states, 20324 states have (on average 1.3492422751426885) internal successors, (27422), 20498 states have internal predecessors, (27422), 5700 states have call successors, (5700), 1142 states have call predecessors, (5700), 1142 states have return successors, (5700), 5526 states have call predecessors, (5700), 5700 states have call successors, (5700) [2025-03-17 02:19:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27167 states to 27167 states and 38822 transitions. [2025-03-17 02:19:56,276 INFO L78 Accepts]: Start accepts. Automaton has 27167 states and 38822 transitions. Word has length 230 [2025-03-17 02:19:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:19:56,276 INFO L471 AbstractCegarLoop]: Abstraction has 27167 states and 38822 transitions. [2025-03-17 02:19:56,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 02:19:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 27167 states and 38822 transitions. [2025-03-17 02:19:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-17 02:19:56,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:19:56,279 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:19:56,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 02:19:56,279 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:19:56,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:19:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1247880086, now seen corresponding path program 1 times [2025-03-17 02:19:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:19:56,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848492025] [2025-03-17 02:19:56,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:19:56,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 02:19:56,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 02:19:56,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:56,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:19:56,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701206734] [2025-03-17 02:19:56,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:19:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:19:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:19:56,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:19:56,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 02:19:56,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 02:19:56,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 02:19:56,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:19:56,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:19:56,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:19:56,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:19:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 02:19:57,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:19:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:19:57,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848492025] [2025-03-17 02:19:57,404 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 02:19:57,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701206734] [2025-03-17 02:19:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701206734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:19:57,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:19:57,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:19:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316004379] [2025-03-17 02:19:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:19:57,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:19:57,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:19:57,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:19:57,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:19:57,405 INFO L87 Difference]: Start difference. First operand 27167 states and 38822 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34)