./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.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 19040c859ca30831fc6cd7ac759a469fd491f693781bcf5be67393e1fb0ba0e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:59:10,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:59:10,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:59:10,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:59:10,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:59:10,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:59:10,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:59:10,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:59:10,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:59:10,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:59:10,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:59:10,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:59:10,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:59:10,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:59:10,418 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:59:10,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:59:10,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:59:10,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:59:10,419 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 -> 19040c859ca30831fc6cd7ac759a469fd491f693781bcf5be67393e1fb0ba0e1 [2025-03-08 10:59:10,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:59:10,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:59:10,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:59:10,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:59:10,652 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:59:10,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-03-08 10:59:11,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7796b13/738eb928abcf44328d6ccbc52afdf7a6/FLAG8b139937a [2025-03-08 10:59:12,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:59:12,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-03-08 10:59:12,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7796b13/738eb928abcf44328d6ccbc52afdf7a6/FLAG8b139937a [2025-03-08 10:59:12,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7796b13/738eb928abcf44328d6ccbc52afdf7a6 [2025-03-08 10:59:12,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:59:12,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:59:12,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:59:12,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:59:12,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:59:12,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12, skipping insertion in model container [2025-03-08 10:59:12,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:59:12,518 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_fillercodesize_ps-cn-250_file-51.i[916,929] [2025-03-08 10:59:12,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:59:12,617 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:59:12,624 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_fillercodesize_ps-cn-250_file-51.i[916,929] [2025-03-08 10:59:12,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:59:12,679 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:59:12,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12 WrapperNode [2025-03-08 10:59:12,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:59:12,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:59:12,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:59:12,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:59:12,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,754 INFO L138 Inliner]: procedures = 26, calls = 88, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2025-03-08 10:59:12,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:59:12,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:59:12,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:59:12,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:59:12,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,801 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:59:12,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:59:12,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:59:12,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:59:12,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:59:12,830 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (1/1) ... [2025-03-08 10:59:12,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:59:12,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:12,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:59:12,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:59:12,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:59:12,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:59:12,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:59:12,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:59:12,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:59:12,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:59:12,960 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:59:12,961 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:59:13,664 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 10:59:13,665 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:59:13,692 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:59:13,694 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:59:13,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:59:13 BoogieIcfgContainer [2025-03-08 10:59:13,695 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:59:13,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:59:13,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:59:13,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:59:13,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:59:12" (1/3) ... [2025-03-08 10:59:13,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba5ca9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:59:13, skipping insertion in model container [2025-03-08 10:59:13,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:12" (2/3) ... [2025-03-08 10:59:13,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba5ca9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:59:13, skipping insertion in model container [2025-03-08 10:59:13,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:59:13" (3/3) ... [2025-03-08 10:59:13,704 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-51.i [2025-03-08 10:59:13,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:59:13,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-51.i that has 2 procedures, 221 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:59:13,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:59:13,783 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;@70513df9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:59:13,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:59:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 143 states have (on average 1.5524475524475525) internal successors, (222), 144 states have internal predecessors, (222), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-08 10:59:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 10:59:13,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:13,809 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:13,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 758045282, now seen corresponding path program 1 times [2025-03-08 10:59:13,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:13,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791904795] [2025-03-08 10:59:13,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:13,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:13,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 10:59:13,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 10:59:13,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:13,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-03-08 10:59:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791904795] [2025-03-08 10:59:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791904795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:59:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685102460] [2025-03-08 10:59:14,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:14,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:59:14,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:14,256 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:59:14,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:59:14,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 10:59:14,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 10:59:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:14,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:14,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:59:14,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:59:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2025-03-08 10:59:14,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:59:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685102460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:14,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:59:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:59:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258214596] [2025-03-08 10:59:14,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:59:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:14,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:59:14,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:59:14,578 INFO L87 Difference]: Start difference. First operand has 221 states, 143 states have (on average 1.5524475524475525) internal successors, (222), 144 states have internal predecessors, (222), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-08 10:59:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:14,630 INFO L93 Difference]: Finished difference Result 436 states and 814 transitions. [2025-03-08 10:59:14,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:59:14,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) Word has length 473 [2025-03-08 10:59:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:14,643 INFO L225 Difference]: With dead ends: 436 [2025-03-08 10:59:14,643 INFO L226 Difference]: Without dead ends: 218 [2025-03-08 10:59:14,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:59:14,649 INFO L435 NwaCegarLoop]: 359 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, 359 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-08 10:59:14,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-08 10:59:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-08 10:59:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 141 states have (on average 1.524822695035461) internal successors, (215), 141 states have internal predecessors, (215), 75 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-08 10:59:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 365 transitions. [2025-03-08 10:59:14,703 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 365 transitions. Word has length 473 [2025-03-08 10:59:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:14,705 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 365 transitions. [2025-03-08 10:59:14,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (75), 2 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-08 10:59:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 365 transitions. [2025-03-08 10:59:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 10:59:14,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:14,712 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:14,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:59:14,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:59:14,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1638964289, now seen corresponding path program 1 times [2025-03-08 10:59:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532272107] [2025-03-08 10:59:14,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:14,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 10:59:15,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 10:59:15,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:15,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:15,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:15,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532272107] [2025-03-08 10:59:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532272107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:15,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:15,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594813099] [2025-03-08 10:59:15,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:15,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:15,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:15,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:15,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:15,360 INFO L87 Difference]: Start difference. First operand 218 states and 365 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:15,470 INFO L93 Difference]: Finished difference Result 588 states and 989 transitions. [2025-03-08 10:59:15,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:15,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-03-08 10:59:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:15,479 INFO L225 Difference]: With dead ends: 588 [2025-03-08 10:59:15,480 INFO L226 Difference]: Without dead ends: 373 [2025-03-08 10:59:15,481 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-08 10:59:15,482 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 255 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:15,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 698 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:59:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-08 10:59:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 370. [2025-03-08 10:59:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 254 states have (on average 1.5551181102362204) internal successors, (395), 255 states have internal predecessors, (395), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 10:59:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 621 transitions. [2025-03-08 10:59:15,520 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 621 transitions. Word has length 473 [2025-03-08 10:59:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:15,521 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 621 transitions. [2025-03-08 10:59:15,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 621 transitions. [2025-03-08 10:59:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 10:59:15,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:15,542 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:15,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:59:15,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:15,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1472655710, now seen corresponding path program 1 times [2025-03-08 10:59:15,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:15,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949885682] [2025-03-08 10:59:15,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:15,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:15,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 10:59:15,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 10:59:15,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:15,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:16,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:16,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949885682] [2025-03-08 10:59:16,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949885682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:16,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:16,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:59:16,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716610651] [2025-03-08 10:59:16,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:16,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:59:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:16,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:59:16,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:59:16,328 INFO L87 Difference]: Start difference. First operand 370 states and 621 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:17,557 INFO L93 Difference]: Finished difference Result 1930 states and 3245 transitions. [2025-03-08 10:59:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:59:17,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-03-08 10:59:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:17,574 INFO L225 Difference]: With dead ends: 1930 [2025-03-08 10:59:17,575 INFO L226 Difference]: Without dead ends: 1563 [2025-03-08 10:59:17,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-08 10:59:17,578 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 1307 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:17,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 2388 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:59:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-03-08 10:59:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1545. [2025-03-08 10:59:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1096 states have (on average 1.573905109489051) internal successors, (1725), 1104 states have internal predecessors, (1725), 438 states have call successors, (438), 10 states have call predecessors, (438), 10 states have return successors, (438), 430 states have call predecessors, (438), 438 states have call successors, (438) [2025-03-08 10:59:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2601 transitions. [2025-03-08 10:59:17,750 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2601 transitions. Word has length 473 [2025-03-08 10:59:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:17,751 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2601 transitions. [2025-03-08 10:59:17,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2601 transitions. [2025-03-08 10:59:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 10:59:17,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:17,759 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:17,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:59:17,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:17,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1023959071, now seen corresponding path program 1 times [2025-03-08 10:59:17,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:17,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289703117] [2025-03-08 10:59:17,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:17,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 10:59:17,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 10:59:17,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:17,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289703117] [2025-03-08 10:59:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289703117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:59:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518162261] [2025-03-08 10:59:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:59:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:18,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:59:18,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:59:18,328 INFO L87 Difference]: Start difference. First operand 1545 states and 2601 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:19,109 INFO L93 Difference]: Finished difference Result 5731 states and 9591 transitions. [2025-03-08 10:59:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:59:19,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 473 [2025-03-08 10:59:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:19,133 INFO L225 Difference]: With dead ends: 5731 [2025-03-08 10:59:19,133 INFO L226 Difference]: Without dead ends: 4189 [2025-03-08 10:59:19,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:19,142 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 739 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:19,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1287 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:59:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2025-03-08 10:59:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 3078. [2025-03-08 10:59:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2160 states have (on average 1.5537037037037038) internal successors, (3356), 2179 states have internal predecessors, (3356), 895 states have call successors, (895), 22 states have call predecessors, (895), 22 states have return successors, (895), 876 states have call predecessors, (895), 895 states have call successors, (895) [2025-03-08 10:59:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 5146 transitions. [2025-03-08 10:59:19,426 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 5146 transitions. Word has length 473 [2025-03-08 10:59:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:19,427 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 5146 transitions. [2025-03-08 10:59:19,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 5146 transitions. [2025-03-08 10:59:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-08 10:59:19,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:19,433 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:19,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:59:19,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:19,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1351114291, now seen corresponding path program 1 times [2025-03-08 10:59:19,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:19,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531255345] [2025-03-08 10:59:19,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:19,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:19,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-08 10:59:19,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-08 10:59:19,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:19,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:19,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531255345] [2025-03-08 10:59:19,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531255345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:19,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:19,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:19,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825423493] [2025-03-08 10:59:19,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:19,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:19,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:19,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:19,804 INFO L87 Difference]: Start difference. First operand 3078 states and 5146 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:20,214 INFO L93 Difference]: Finished difference Result 7454 states and 12531 transitions. [2025-03-08 10:59:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:59:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 474 [2025-03-08 10:59:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:20,238 INFO L225 Difference]: With dead ends: 7454 [2025-03-08 10:59:20,238 INFO L226 Difference]: Without dead ends: 4379 [2025-03-08 10:59:20,250 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-08 10:59:20,253 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 326 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:20,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1053 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:59:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4379 states. [2025-03-08 10:59:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4379 to 4035. [2025-03-08 10:59:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 3039 states have (on average 1.6028298782494241) internal successors, (4871), 3058 states have internal predecessors, (4871), 970 states have call successors, (970), 25 states have call predecessors, (970), 25 states have return successors, (970), 951 states have call predecessors, (970), 970 states have call successors, (970) [2025-03-08 10:59:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 6811 transitions. [2025-03-08 10:59:20,560 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 6811 transitions. Word has length 474 [2025-03-08 10:59:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:20,561 INFO L471 AbstractCegarLoop]: Abstraction has 4035 states and 6811 transitions. [2025-03-08 10:59:20,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 6811 transitions. [2025-03-08 10:59:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-08 10:59:20,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:20,566 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:20,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:59:20,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:20,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:20,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2040459573, now seen corresponding path program 1 times [2025-03-08 10:59:20,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:20,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280962639] [2025-03-08 10:59:20,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:20,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-08 10:59:20,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-08 10:59:20,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:20,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:21,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:21,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280962639] [2025-03-08 10:59:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280962639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:21,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403121470] [2025-03-08 10:59:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:21,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:21,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:21,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:21,020 INFO L87 Difference]: Start difference. First operand 4035 states and 6811 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:21,285 INFO L93 Difference]: Finished difference Result 9278 states and 15604 transitions. [2025-03-08 10:59:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:59:21,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 475 [2025-03-08 10:59:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:21,316 INFO L225 Difference]: With dead ends: 9278 [2025-03-08 10:59:21,316 INFO L226 Difference]: Without dead ends: 5955 [2025-03-08 10:59:21,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:21,329 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 232 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:21,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1019 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:59:21,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2025-03-08 10:59:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 5950. [2025-03-08 10:59:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5950 states, 4497 states have (on average 1.601067378252168) internal successors, (7200), 4528 states have internal predecessors, (7200), 1408 states have call successors, (1408), 44 states have call predecessors, (1408), 44 states have return successors, (1408), 1377 states have call predecessors, (1408), 1408 states have call successors, (1408) [2025-03-08 10:59:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 10016 transitions. [2025-03-08 10:59:21,767 INFO L78 Accepts]: Start accepts. Automaton has 5950 states and 10016 transitions. Word has length 475 [2025-03-08 10:59:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:21,768 INFO L471 AbstractCegarLoop]: Abstraction has 5950 states and 10016 transitions. [2025-03-08 10:59:21,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5950 states and 10016 transitions. [2025-03-08 10:59:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-08 10:59:21,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:21,774 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:21,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:59:21,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:21,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1229015724, now seen corresponding path program 1 times [2025-03-08 10:59:21,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:21,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170414871] [2025-03-08 10:59:21,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:21,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-08 10:59:21,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-08 10:59:21,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:21,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170414871] [2025-03-08 10:59:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170414871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:22,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:59:22,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951415305] [2025-03-08 10:59:22,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:22,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:59:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:22,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:59:22,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:59:22,306 INFO L87 Difference]: Start difference. First operand 5950 states and 10016 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:23,155 INFO L93 Difference]: Finished difference Result 15298 states and 25509 transitions. [2025-03-08 10:59:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:59:23,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 475 [2025-03-08 10:59:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:23,223 INFO L225 Difference]: With dead ends: 15298 [2025-03-08 10:59:23,223 INFO L226 Difference]: Without dead ends: 10710 [2025-03-08 10:59:23,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:23,245 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 337 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:23,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1266 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:59:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10710 states. [2025-03-08 10:59:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10710 to 10536. [2025-03-08 10:59:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10536 states, 7710 states have (on average 1.5749675745784695) internal successors, (12143), 7772 states have internal predecessors, (12143), 2741 states have call successors, (2741), 84 states have call predecessors, (2741), 84 states have return successors, (2741), 2679 states have call predecessors, (2741), 2741 states have call successors, (2741) [2025-03-08 10:59:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10536 states to 10536 states and 17625 transitions. [2025-03-08 10:59:24,119 INFO L78 Accepts]: Start accepts. Automaton has 10536 states and 17625 transitions. Word has length 475 [2025-03-08 10:59:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:24,120 INFO L471 AbstractCegarLoop]: Abstraction has 10536 states and 17625 transitions. [2025-03-08 10:59:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 10536 states and 17625 transitions. [2025-03-08 10:59:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 10:59:24,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:24,128 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:24,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:59:24,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:24,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1832670708, now seen corresponding path program 1 times [2025-03-08 10:59:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:24,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278640277] [2025-03-08 10:59:24,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:24,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 10:59:24,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 10:59:24,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:24,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:24,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278640277] [2025-03-08 10:59:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278640277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:24,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:24,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005109097] [2025-03-08 10:59:24,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:24,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:24,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:24,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:24,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:24,457 INFO L87 Difference]: Start difference. First operand 10536 states and 17625 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-08 10:59:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:25,483 INFO L93 Difference]: Finished difference Result 28884 states and 48131 transitions. [2025-03-08 10:59:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:25,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 476 [2025-03-08 10:59:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:25,567 INFO L225 Difference]: With dead ends: 28884 [2025-03-08 10:59:25,567 INFO L226 Difference]: Without dead ends: 19710 [2025-03-08 10:59:25,602 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-08 10:59:25,603 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 332 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:25,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1036 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:59:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19710 states. [2025-03-08 10:59:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19710 to 19708. [2025-03-08 10:59:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19708 states, 14136 states have (on average 1.5559564233163554) internal successors, (21995), 14260 states have internal predecessors, (21995), 5407 states have call successors, (5407), 164 states have call predecessors, (5407), 164 states have return successors, (5407), 5283 states have call predecessors, (5407), 5407 states have call successors, (5407) [2025-03-08 10:59:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19708 states to 19708 states and 32809 transitions. [2025-03-08 10:59:27,321 INFO L78 Accepts]: Start accepts. Automaton has 19708 states and 32809 transitions. Word has length 476 [2025-03-08 10:59:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:27,322 INFO L471 AbstractCegarLoop]: Abstraction has 19708 states and 32809 transitions. [2025-03-08 10:59:27,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2025-03-08 10:59:27,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19708 states and 32809 transitions. [2025-03-08 10:59:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 10:59:27,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:27,328 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:27,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:59:27,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1636157203, now seen corresponding path program 1 times [2025-03-08 10:59:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:27,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878416772] [2025-03-08 10:59:27,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:27,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 10:59:27,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 10:59:27,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:27,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:27,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878416772] [2025-03-08 10:59:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878416772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:27,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646452679] [2025-03-08 10:59:27,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:27,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:27,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:27,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:27,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:27,688 INFO L87 Difference]: Start difference. First operand 19708 states and 32809 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:28,485 INFO L93 Difference]: Finished difference Result 38394 states and 63824 transitions. [2025-03-08 10:59:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:28,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 476 [2025-03-08 10:59:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:28,575 INFO L225 Difference]: With dead ends: 38394 [2025-03-08 10:59:28,575 INFO L226 Difference]: Without dead ends: 20048 [2025-03-08 10:59:28,621 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-08 10:59:28,623 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 17 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:28,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 721 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20048 states. [2025-03-08 10:59:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20048 to 19708. [2025-03-08 10:59:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19708 states, 14136 states have (on average 1.546335597057159) internal successors, (21859), 14260 states have internal predecessors, (21859), 5407 states have call successors, (5407), 164 states have call predecessors, (5407), 164 states have return successors, (5407), 5283 states have call predecessors, (5407), 5407 states have call successors, (5407) [2025-03-08 10:59:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19708 states to 19708 states and 32673 transitions. [2025-03-08 10:59:30,056 INFO L78 Accepts]: Start accepts. Automaton has 19708 states and 32673 transitions. Word has length 476 [2025-03-08 10:59:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:30,057 INFO L471 AbstractCegarLoop]: Abstraction has 19708 states and 32673 transitions. [2025-03-08 10:59:30,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 19708 states and 32673 transitions. [2025-03-08 10:59:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 10:59:30,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:30,063 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:30,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:59:30,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:30,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:30,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1201576365, now seen corresponding path program 1 times [2025-03-08 10:59:30,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:30,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164469509] [2025-03-08 10:59:30,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:30,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:30,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 10:59:30,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 10:59:30,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:30,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-08 10:59:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164469509] [2025-03-08 10:59:30,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164469509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:59:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673070176] [2025-03-08 10:59:30,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:30,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:59:30,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:30,549 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-08 10:59:30,555 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-08 10:59:30,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 10:59:30,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 10:59:30,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:30,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:30,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:59:30,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:59:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 2202 proven. 198 refuted. 0 times theorem prover too weak. 8700 trivial. 0 not checked. [2025-03-08 10:59:31,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:59:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 24 proven. 198 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-08 10:59:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673070176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:59:31,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:59:31,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 10:59:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120559023] [2025-03-08 10:59:31,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:59:31,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:59:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:31,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:59:31,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:59:31,845 INFO L87 Difference]: Start difference. First operand 19708 states and 32673 transitions. Second operand has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-03-08 10:59:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:33,610 INFO L93 Difference]: Finished difference Result 29758 states and 48597 transitions. [2025-03-08 10:59:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:59:33,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) Word has length 477 [2025-03-08 10:59:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:33,721 INFO L225 Difference]: With dead ends: 29758 [2025-03-08 10:59:33,721 INFO L226 Difference]: Without dead ends: 20584 [2025-03-08 10:59:33,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 951 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:59:33,760 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 135 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:33,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 674 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:59:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20584 states. [2025-03-08 10:59:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20584 to 10812. [2025-03-08 10:59:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10812 states, 7917 states have (on average 1.5427560944802323) internal successors, (12214), 7979 states have internal predecessors, (12214), 2741 states have call successors, (2741), 153 states have call predecessors, (2741), 153 states have return successors, (2741), 2679 states have call predecessors, (2741), 2741 states have call successors, (2741) [2025-03-08 10:59:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10812 states to 10812 states and 17696 transitions. [2025-03-08 10:59:34,881 INFO L78 Accepts]: Start accepts. Automaton has 10812 states and 17696 transitions. Word has length 477 [2025-03-08 10:59:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:34,882 INFO L471 AbstractCegarLoop]: Abstraction has 10812 states and 17696 transitions. [2025-03-08 10:59:34,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.625) internal successors, (197), 8 states have internal predecessors, (197), 3 states have call successors, (207), 2 states have call predecessors, (207), 4 states have return successors, (208), 3 states have call predecessors, (208), 3 states have call successors, (208) [2025-03-08 10:59:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10812 states and 17696 transitions. [2025-03-08 10:59:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 10:59:34,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:34,888 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:34,897 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-08 10:59:35,092 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,SelfDestructingSolverStorable9 [2025-03-08 10:59:35,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:35,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1398089870, now seen corresponding path program 1 times [2025-03-08 10:59:35,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:35,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62897380] [2025-03-08 10:59:35,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:35,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:35,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 10:59:35,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 10:59:35,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:35,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 54 proven. 168 refuted. 0 times theorem prover too weak. 10878 trivial. 0 not checked. [2025-03-08 10:59:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62897380] [2025-03-08 10:59:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62897380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:59:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152357716] [2025-03-08 10:59:35,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:35,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:59:35,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:35,698 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-08 10:59:35,700 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-08 10:59:35,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 10:59:35,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 10:59:35,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:35,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:35,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 10:59:35,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:59:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 5627 proven. 162 refuted. 0 times theorem prover too weak. 5311 trivial. 0 not checked. [2025-03-08 10:59:36,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:59:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 276 proven. 165 refuted. 0 times theorem prover too weak. 10659 trivial. 0 not checked. [2025-03-08 10:59:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152357716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:59:37,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:59:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 16 [2025-03-08 10:59:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048160129] [2025-03-08 10:59:37,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:59:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:59:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:59:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:59:37,154 INFO L87 Difference]: Start difference. First operand 10812 states and 17696 transitions. Second operand has 16 states, 16 states have (on average 13.6875) internal successors, (219), 16 states have internal predecessors, (219), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-03-08 10:59:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:42,374 INFO L93 Difference]: Finished difference Result 48538 states and 76068 transitions. [2025-03-08 10:59:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-08 10:59:42,375 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 13.6875) internal successors, (219), 16 states have internal predecessors, (219), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) Word has length 477 [2025-03-08 10:59:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:42,519 INFO L225 Difference]: With dead ends: 48538 [2025-03-08 10:59:42,519 INFO L226 Difference]: Without dead ends: 38290 [2025-03-08 10:59:42,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 952 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1417, Invalid=4745, Unknown=0, NotChecked=0, Total=6162 [2025-03-08 10:59:42,558 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 1688 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 1070 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 3525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:42,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 2262 Invalid, 3525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1070 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 10:59:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38290 states. [2025-03-08 10:59:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38290 to 25268. [2025-03-08 10:59:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25268 states, 18036 states have (on average 1.4555333776890662) internal successors, (26252), 18228 states have internal predecessors, (26252), 6563 states have call successors, (6563), 668 states have call predecessors, (6563), 668 states have return successors, (6563), 6371 states have call predecessors, (6563), 6563 states have call successors, (6563) [2025-03-08 10:59:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25268 states to 25268 states and 39378 transitions. [2025-03-08 10:59:45,196 INFO L78 Accepts]: Start accepts. Automaton has 25268 states and 39378 transitions. Word has length 477 [2025-03-08 10:59:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:45,197 INFO L471 AbstractCegarLoop]: Abstraction has 25268 states and 39378 transitions. [2025-03-08 10:59:45,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.6875) internal successors, (219), 16 states have internal predecessors, (219), 4 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (162), 4 states have call predecessors, (162), 4 states have call successors, (162) [2025-03-08 10:59:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 25268 states and 39378 transitions. [2025-03-08 10:59:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 10:59:45,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:45,207 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:45,216 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-08 10:59:45,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:59:45,408 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:45,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1541761459, now seen corresponding path program 1 times [2025-03-08 10:59:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137935863] [2025-03-08 10:59:45,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:45,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 10:59:45,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 10:59:45,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:45,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:45,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:45,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137935863] [2025-03-08 10:59:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137935863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:45,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:45,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:45,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007999561] [2025-03-08 10:59:45,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:45,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:45,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:45,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:45,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:45,686 INFO L87 Difference]: Start difference. First operand 25268 states and 39378 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:49,170 INFO L93 Difference]: Finished difference Result 60900 states and 94606 transitions. [2025-03-08 10:59:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:49,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 478 [2025-03-08 10:59:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:49,314 INFO L225 Difference]: With dead ends: 60900 [2025-03-08 10:59:49,314 INFO L226 Difference]: Without dead ends: 37542 [2025-03-08 10:59:49,383 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-08 10:59:49,384 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 212 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:49,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 693 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37542 states. [2025-03-08 10:59:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37542 to 37540. [2025-03-08 10:59:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37540 states, 26734 states have (on average 1.4509613226602829) internal successors, (38790), 27022 states have internal predecessors, (38790), 9807 states have call successors, (9807), 998 states have call predecessors, (9807), 998 states have return successors, (9807), 9519 states have call predecessors, (9807), 9807 states have call successors, (9807) [2025-03-08 10:59:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37540 states to 37540 states and 58404 transitions. [2025-03-08 10:59:52,887 INFO L78 Accepts]: Start accepts. Automaton has 37540 states and 58404 transitions. Word has length 478 [2025-03-08 10:59:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:52,887 INFO L471 AbstractCegarLoop]: Abstraction has 37540 states and 58404 transitions. [2025-03-08 10:59:52,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 37540 states and 58404 transitions. [2025-03-08 10:59:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 10:59:52,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:52,903 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:52,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:59:52,903 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:52,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1034225307, now seen corresponding path program 1 times [2025-03-08 10:59:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974423217] [2025-03-08 10:59:52,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:52,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:52,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 10:59:52,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 10:59:52,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:52,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 10:59:53,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:53,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974423217] [2025-03-08 10:59:53,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974423217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:53,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:53,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:53,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730527803] [2025-03-08 10:59:53,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:53,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:53,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:53,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:53,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:53,027 INFO L87 Difference]: Start difference. First operand 37540 states and 58404 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 10:59:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:56,502 INFO L93 Difference]: Finished difference Result 78860 states and 121929 transitions. [2025-03-08 10:59:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:56,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 478 [2025-03-08 10:59:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:56,683 INFO L225 Difference]: With dead ends: 78860 [2025-03-08 10:59:56,683 INFO L226 Difference]: Without dead ends: 42488 [2025-03-08 10:59:56,879 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-08 10:59:56,880 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 239 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:56,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 701 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:56,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42488 states. [2025-03-08 11:00:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42488 to 42254. [2025-03-08 11:00:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42254 states, 29695 states have (on average 1.4310489981478363) internal successors, (42495), 30019 states have internal predecessors, (42495), 11307 states have call successors, (11307), 1251 states have call predecessors, (11307), 1251 states have return successors, (11307), 10983 states have call predecessors, (11307), 11307 states have call successors, (11307) [2025-03-08 11:00:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42254 states to 42254 states and 65109 transitions. [2025-03-08 11:00:00,838 INFO L78 Accepts]: Start accepts. Automaton has 42254 states and 65109 transitions. Word has length 478 [2025-03-08 11:00:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:00,839 INFO L471 AbstractCegarLoop]: Abstraction has 42254 states and 65109 transitions. [2025-03-08 11:00:00,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 11:00:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 42254 states and 65109 transitions. [2025-03-08 11:00:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 11:00:00,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:00,847 INFO L218 NwaCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:00:00,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:00:00,847 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:00,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 236197076, now seen corresponding path program 1 times [2025-03-08 11:00:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:00,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213981028] [2025-03-08 11:00:00,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:00,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:00,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 11:00:00,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 11:00:00,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:00,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11100 trivial. 0 not checked. [2025-03-08 11:00:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:02,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213981028] [2025-03-08 11:00:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213981028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:00:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997245029] [2025-03-08 11:00:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:00:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:02,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:00:02,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:00:02,218 INFO L87 Difference]: Start difference. First operand 42254 states and 65109 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) [2025-03-08 11:00:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:20,620 INFO L93 Difference]: Finished difference Result 175086 states and 266428 transitions. [2025-03-08 11:00:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:00:20,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 1 states have call successors, (75), 1 states have call predecessors, (75), 1 states have return successors, (75), 1 states have call predecessors, (75), 1 states have call successors, (75) Word has length 478 [2025-03-08 11:00:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:21,525 INFO L225 Difference]: With dead ends: 175086 [2025-03-08 11:00:21,525 INFO L226 Difference]: Without dead ends: 135609 [2025-03-08 11:00:21,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:00:21,635 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 1739 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:21,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 3315 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 11:00:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135609 states.