./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.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 6abe9611945b9347dad66f4454ebe10d21d58cf2fa4c1fd6e8973cdda78a961e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:53:42,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:53:42,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:53:42,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:53:42,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:53:42,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:53:42,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:53:42,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:53:42,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:53:42,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:53:42,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:53:42,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:53:42,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:53:42,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:53:42,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:53:42,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:53:42,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:53:42,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:53:42,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:53:42,914 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 -> 6abe9611945b9347dad66f4454ebe10d21d58cf2fa4c1fd6e8973cdda78a961e [2025-03-17 00:53:43,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:53:43,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:53:43,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:53:43,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:53:43,126 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:53:43,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-03-17 00:53:44,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b0ba9ef/ce065bfb26a144f199a7bca2630e0ebb/FLAG7a12c9a35 [2025-03-17 00:53:44,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:53:44,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-03-17 00:53:44,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b0ba9ef/ce065bfb26a144f199a7bca2630e0ebb/FLAG7a12c9a35 [2025-03-17 00:53:44,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b0ba9ef/ce065bfb26a144f199a7bca2630e0ebb [2025-03-17 00:53:44,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:53:44,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:53:44,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:53:44,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:53:44,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:53:44,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d81f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44, skipping insertion in model container [2025-03-17 00:53:44,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:53:44,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i[919,932] [2025-03-17 00:53:44,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:53:44,695 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:53:44,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i[919,932] [2025-03-17 00:53:44,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:53:44,753 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:53:44,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44 WrapperNode [2025-03-17 00:53:44,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:53:44,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:53:44,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:53:44,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:53:44,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,796 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-17 00:53:44,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:53:44,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:53:44,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:53:44,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:53:44,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,828 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:53:44,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:53:44,852 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:53:44,853 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:53:44,853 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:53:44,854 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (1/1) ... [2025-03-17 00:53:44,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:53:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:53:44,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:53:44,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:53:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:53:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:53:44,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:53:44,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:53:44,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:53:44,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:53:44,960 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:53:44,961 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:53:45,346 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-17 00:53:45,347 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:53:45,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:53:45,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:53:45,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:53:45 BoogieIcfgContainer [2025-03-17 00:53:45,366 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:53:45,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:53:45,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:53:45,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:53:45,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:53:44" (1/3) ... [2025-03-17 00:53:45,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a41d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:53:45, skipping insertion in model container [2025-03-17 00:53:45,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:53:44" (2/3) ... [2025-03-17 00:53:45,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a41d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:53:45, skipping insertion in model container [2025-03-17 00:53:45,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:53:45" (3/3) ... [2025-03-17 00:53:45,374 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-03-17 00:53:45,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:53:45,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:53:45,428 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:53:45,437 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;@57d1f1e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:53:45,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:53:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 62 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 00:53:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:53:45,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:53:45,453 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:53:45,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:53:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:53:45,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1733634730, now seen corresponding path program 1 times [2025-03-17 00:53:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:53:45,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699924918] [2025-03-17 00:53:45,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:53:45,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:53:45,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:53:45,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:53:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:53:45,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:53:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-17 00:53:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:53:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699924918] [2025-03-17 00:53:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699924918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:53:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777106973] [2025-03-17 00:53:45,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:53:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:53:45,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:53:45,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:53:45,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:53:45,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:53:45,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:53:45,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:53:45,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:53:45,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:53:45,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:53:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-17 00:53:45,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:53:45,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777106973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:53:45,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:53:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:53:45,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987237841] [2025-03-17 00:53:45,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:53:45,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:53:45,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:53:45,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:53:45,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:53:45,945 INFO L87 Difference]: Start difference. First operand has 91 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 62 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 00:53:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:53:45,967 INFO L93 Difference]: Finished difference Result 179 states and 319 transitions. [2025-03-17 00:53:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:53:45,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2025-03-17 00:53:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:53:45,973 INFO L225 Difference]: With dead ends: 179 [2025-03-17 00:53:45,973 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 00:53:45,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:53:45,977 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:53:45,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:53:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 00:53:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 00:53:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 60 states have internal predecessors, (88), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 00:53:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 142 transitions. [2025-03-17 00:53:46,008 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 142 transitions. Word has length 170 [2025-03-17 00:53:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:53:46,008 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 142 transitions. [2025-03-17 00:53:46,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 00:53:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2025-03-17 00:53:46,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:53:46,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:53:46,011 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:53:46,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:53:46,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:53:46,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:53:46,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:53:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1882417547, now seen corresponding path program 1 times [2025-03-17 00:53:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:53:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960479740] [2025-03-17 00:53:46,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:53:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:53:46,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:53:46,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:53:46,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:53:46,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:53:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:53:46,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:53:46,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960479740] [2025-03-17 00:53:46,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960479740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:53:46,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:53:46,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:53:46,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715145382] [2025-03-17 00:53:46,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:53:46,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:53:46,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:53:46,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:53:46,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:53:46,526 INFO L87 Difference]: Start difference. First operand 89 states and 142 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:53:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:53:46,567 INFO L93 Difference]: Finished difference Result 178 states and 285 transitions. [2025-03-17 00:53:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:53:46,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-17 00:53:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:53:46,569 INFO L225 Difference]: With dead ends: 178 [2025-03-17 00:53:46,569 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 00:53:46,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:53:46,572 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:53:46,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:53:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 00:53:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 00:53:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.459016393442623) internal successors, (89), 61 states have internal predecessors, (89), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 00:53:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 143 transitions. [2025-03-17 00:53:46,581 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 143 transitions. Word has length 170 [2025-03-17 00:53:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:53:46,582 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 143 transitions. [2025-03-17 00:53:46,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:53:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 143 transitions. [2025-03-17 00:53:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:53:46,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:53:46,584 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:53:46,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:53:46,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:53:46,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:53:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1911046698, now seen corresponding path program 1 times [2025-03-17 00:53:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:53:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592353196] [2025-03-17 00:53:46,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:53:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:53:46,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:53:46,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:53:46,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:53:46,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:53:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:53:46,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:53:46,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592353196] [2025-03-17 00:53:46,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592353196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:53:46,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:53:46,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:53:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263508785] [2025-03-17 00:53:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:53:46,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:53:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:53:46,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:53:46,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:53:46,862 INFO L87 Difference]: Start difference. First operand 90 states and 143 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:53:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:53:47,053 INFO L93 Difference]: Finished difference Result 269 states and 428 transitions. [2025-03-17 00:53:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:53:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-17 00:53:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:53:47,056 INFO L225 Difference]: With dead ends: 269 [2025-03-17 00:53:47,058 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 00:53:47,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-17 00:53:47,059 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 110 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:53:47,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 472 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:53:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 00:53:47,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136. [2025-03-17 00:53:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 79 states have internal predecessors, (107), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 00:53:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 215 transitions. [2025-03-17 00:53:47,082 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 215 transitions. Word has length 170 [2025-03-17 00:53:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:53:47,082 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 215 transitions. [2025-03-17 00:53:47,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:53:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 215 transitions. [2025-03-17 00:53:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:53:47,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:53:47,088 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:53:47,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:53:47,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:53:47,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:53:47,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1502222473, now seen corresponding path program 1 times [2025-03-17 00:53:47,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:53:47,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112975602] [2025-03-17 00:53:47,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:53:47,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:53:47,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:53:47,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:53:47,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:53:47,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:53:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:53:53,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:53:53,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112975602] [2025-03-17 00:53:53,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112975602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:53:53,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:53:53,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:53:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622269035] [2025-03-17 00:53:53,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:53:53,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:53:53,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:53:53,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:53:53,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:53:53,254 INFO L87 Difference]: Start difference. First operand 136 states and 215 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:53:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:53:55,867 INFO L93 Difference]: Finished difference Result 421 states and 668 transitions. [2025-03-17 00:53:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:53:55,867 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-17 00:53:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:53:55,869 INFO L225 Difference]: With dead ends: 421 [2025-03-17 00:53:55,869 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 00:53:55,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-03-17 00:53:55,874 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 884 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:53:55,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 733 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 00:53:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 00:53:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 177. [2025-03-17 00:53:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 120 states have (on average 1.425) internal successors, (171), 120 states have internal predecessors, (171), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 00:53:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 279 transitions. [2025-03-17 00:53:55,898 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 279 transitions. Word has length 170 [2025-03-17 00:53:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:53:55,898 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 279 transitions. [2025-03-17 00:53:55,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:53:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 279 transitions. [2025-03-17 00:53:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-17 00:53:55,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:53:55,900 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:53:55,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:53:55,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:53:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:53:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1439435126, now seen corresponding path program 1 times [2025-03-17 00:53:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:53:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612594191] [2025-03-17 00:53:55,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:53:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:53:55,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-17 00:53:55,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 00:53:55,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:53:55,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:53:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:53:55,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:53:55,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612594191] [2025-03-17 00:53:55,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612594191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:53:55,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:53:55,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:53:55,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619952727] [2025-03-17 00:53:55,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:53:55,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:53:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:53:55,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:53:55,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:53:55,961 INFO L87 Difference]: Start difference. First operand 177 states and 279 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:53:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:53:56,006 INFO L93 Difference]: Finished difference Result 354 states and 561 transitions. [2025-03-17 00:53:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:53:56,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-17 00:53:56,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:53:56,009 INFO L225 Difference]: With dead ends: 354 [2025-03-17 00:53:56,011 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 00:53:56,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:53:56,012 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 134 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:53:56,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 314 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:53:56,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 00:53:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2025-03-17 00:53:56,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 178 states have (on average 1.4213483146067416) internal successors, (253), 178 states have internal predecessors, (253), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:53:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 415 transitions. [2025-03-17 00:53:56,042 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 415 transitions. Word has length 170 [2025-03-17 00:53:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:53:56,043 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 415 transitions. [2025-03-17 00:53:56,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:53:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 415 transitions. [2025-03-17 00:53:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:53:56,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:53:56,044 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:53:56,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:53:56,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:53:56,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:53:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1262781812, now seen corresponding path program 1 times [2025-03-17 00:53:56,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:53:56,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392790475] [2025-03-17 00:53:56,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:53:56,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:53:56,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:53:56,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:53:56,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:53:56,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:54:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:54:01,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:54:01,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392790475] [2025-03-17 00:54:01,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392790475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:54:01,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:54:01,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:54:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143651832] [2025-03-17 00:54:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:54:01,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:54:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:54:01,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:54:01,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:54:01,217 INFO L87 Difference]: Start difference. First operand 263 states and 415 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:54:03,740 INFO L93 Difference]: Finished difference Result 409 states and 637 transitions. [2025-03-17 00:54:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 00:54:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 00:54:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:54:03,742 INFO L225 Difference]: With dead ends: 409 [2025-03-17 00:54:03,743 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 00:54:03,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:54:03,746 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 681 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:54:03,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 968 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:54:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 00:54:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 264. [2025-03-17 00:54:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 179 states have (on average 1.4189944134078212) internal successors, (254), 179 states have internal predecessors, (254), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:54:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 416 transitions. [2025-03-17 00:54:03,772 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 416 transitions. Word has length 171 [2025-03-17 00:54:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:54:03,773 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 416 transitions. [2025-03-17 00:54:03,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 416 transitions. [2025-03-17 00:54:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:54:03,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:54:03,774 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:54:03,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:54:03,774 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:54:03,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:54:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1085334001, now seen corresponding path program 1 times [2025-03-17 00:54:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:54:03,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904181979] [2025-03-17 00:54:03,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:54:03,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:54:03,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:54:03,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:54:03,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:54:03,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:54:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:54:03,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:54:03,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904181979] [2025-03-17 00:54:03,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904181979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:54:03,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:54:03,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:54:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631296824] [2025-03-17 00:54:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:54:03,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:54:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:54:03,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:54:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:54:03,956 INFO L87 Difference]: Start difference. First operand 264 states and 416 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:54:04,011 INFO L93 Difference]: Finished difference Result 500 states and 793 transitions. [2025-03-17 00:54:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:54:04,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 00:54:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:54:04,014 INFO L225 Difference]: With dead ends: 500 [2025-03-17 00:54:04,014 INFO L226 Difference]: Without dead ends: 322 [2025-03-17 00:54:04,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:54:04,015 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:54:04,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 373 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:54:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-17 00:54:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 264. [2025-03-17 00:54:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:54:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 413 transitions. [2025-03-17 00:54:04,028 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 413 transitions. Word has length 171 [2025-03-17 00:54:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:54:04,028 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 413 transitions. [2025-03-17 00:54:04,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 413 transitions. [2025-03-17 00:54:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:54:04,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:54:04,030 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:54:04,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:54:04,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:54:04,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:54:04,030 INFO L85 PathProgramCache]: Analyzing trace with hash 791930994, now seen corresponding path program 1 times [2025-03-17 00:54:04,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:54:04,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852150602] [2025-03-17 00:54:04,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:54:04,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:54:04,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:54:04,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:54:04,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:54:04,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:54:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:54:08,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:54:08,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852150602] [2025-03-17 00:54:08,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852150602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:54:08,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:54:08,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 00:54:08,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742011560] [2025-03-17 00:54:08,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:54:08,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:54:08,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:54:08,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:54:08,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:54:08,656 INFO L87 Difference]: Start difference. First operand 264 states and 413 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 00:54:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:54:12,024 INFO L93 Difference]: Finished difference Result 409 states and 632 transitions. [2025-03-17 00:54:12,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 00:54:12,025 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2025-03-17 00:54:12,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:54:12,028 INFO L225 Difference]: With dead ends: 409 [2025-03-17 00:54:12,028 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 00:54:12,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2025-03-17 00:54:12,029 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 613 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:54:12,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1139 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:54:12,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 00:54:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 264. [2025-03-17 00:54:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 179 states have (on average 1.4022346368715084) internal successors, (251), 179 states have internal predecessors, (251), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:54:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 413 transitions. [2025-03-17 00:54:12,047 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 413 transitions. Word has length 171 [2025-03-17 00:54:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:54:12,047 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 413 transitions. [2025-03-17 00:54:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 00:54:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 413 transitions. [2025-03-17 00:54:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:54:12,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:54:12,051 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:54:12,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:54:12,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:54:12,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:54:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash -893223471, now seen corresponding path program 1 times [2025-03-17 00:54:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:54:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698483085] [2025-03-17 00:54:12,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:54:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:54:12,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:54:12,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:54:12,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:54:12,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:54:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:54:12,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:54:12,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698483085] [2025-03-17 00:54:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698483085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:54:12,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:54:12,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:54:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792361363] [2025-03-17 00:54:12,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:54:12,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:54:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:54:12,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:54:12,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:54:12,209 INFO L87 Difference]: Start difference. First operand 264 states and 413 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:54:12,270 INFO L93 Difference]: Finished difference Result 573 states and 898 transitions. [2025-03-17 00:54:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:54:12,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 00:54:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:54:12,273 INFO L225 Difference]: With dead ends: 573 [2025-03-17 00:54:12,273 INFO L226 Difference]: Without dead ends: 398 [2025-03-17 00:54:12,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:54:12,274 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 105 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:54:12,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 419 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:54:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-17 00:54:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 283. [2025-03-17 00:54:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 198 states have (on average 1.404040404040404) internal successors, (278), 198 states have internal predecessors, (278), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:54:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 440 transitions. [2025-03-17 00:54:12,286 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 440 transitions. Word has length 171 [2025-03-17 00:54:12,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:54:12,286 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 440 transitions. [2025-03-17 00:54:12,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 440 transitions. [2025-03-17 00:54:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-17 00:54:12,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:54:12,288 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:54:12,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:54:12,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:54:12,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:54:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1089736976, now seen corresponding path program 1 times [2025-03-17 00:54:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:54:12,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422245822] [2025-03-17 00:54:12,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:54:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:54:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-17 00:54:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-17 00:54:12,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:54:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:54:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:54:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:54:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422245822] [2025-03-17 00:54:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422245822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:54:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:54:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 00:54:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918108097] [2025-03-17 00:54:19,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:54:19,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:54:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:54:19,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:54:19,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:54:19,828 INFO L87 Difference]: Start difference. First operand 283 states and 440 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:54:26,999 INFO L93 Difference]: Finished difference Result 465 states and 714 transitions. [2025-03-17 00:54:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:54:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-17 00:54:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:54:27,001 INFO L225 Difference]: With dead ends: 465 [2025-03-17 00:54:27,001 INFO L226 Difference]: Without dead ends: 463 [2025-03-17 00:54:27,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2025-03-17 00:54:27,002 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 539 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:54:27,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1057 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 00:54:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-17 00:54:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 326. [2025-03-17 00:54:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 241 states have (on average 1.4273858921161826) internal successors, (344), 241 states have internal predecessors, (344), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:54:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 506 transitions. [2025-03-17 00:54:27,018 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 506 transitions. Word has length 171 [2025-03-17 00:54:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:54:27,018 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 506 transitions. [2025-03-17 00:54:27,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 506 transitions. [2025-03-17 00:54:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:54:27,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:54:27,020 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:54:27,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:54:27,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:54:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:54:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash 718582443, now seen corresponding path program 1 times [2025-03-17 00:54:27,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:54:27,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006312723] [2025-03-17 00:54:27,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:54:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:54:27,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:54:27,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:54:27,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:54:27,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:54:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:54:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:54:31,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006312723] [2025-03-17 00:54:31,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006312723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:54:31,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:54:31,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 00:54:31,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640247941] [2025-03-17 00:54:31,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:54:31,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:54:31,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:54:31,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:54:31,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:54:31,580 INFO L87 Difference]: Start difference. First operand 326 states and 506 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:54:34,564 INFO L93 Difference]: Finished difference Result 484 states and 749 transitions. [2025-03-17 00:54:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 00:54:34,565 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 00:54:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:54:34,567 INFO L225 Difference]: With dead ends: 484 [2025-03-17 00:54:34,567 INFO L226 Difference]: Without dead ends: 482 [2025-03-17 00:54:34,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2025-03-17 00:54:34,568 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 569 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:54:34,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1233 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 00:54:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-17 00:54:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 323. [2025-03-17 00:54:34,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 238 states have (on average 1.4285714285714286) internal successors, (340), 238 states have internal predecessors, (340), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:54:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 502 transitions. [2025-03-17 00:54:34,586 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 502 transitions. Word has length 172 [2025-03-17 00:54:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:54:34,586 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 502 transitions. [2025-03-17 00:54:34,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 502 transitions. [2025-03-17 00:54:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:54:34,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:54:34,588 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:54:34,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:54:34,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:54:34,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:54:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1975063284, now seen corresponding path program 1 times [2025-03-17 00:54:34,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:54:34,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132978728] [2025-03-17 00:54:34,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:54:34,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:54:34,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:54:34,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:54:34,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:54:34,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:54:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:54:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:54:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132978728] [2025-03-17 00:54:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132978728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:54:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:54:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 00:54:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773078262] [2025-03-17 00:54:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:54:43,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 00:54:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:54:43,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 00:54:43,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:54:43,174 INFO L87 Difference]: Start difference. First operand 323 states and 502 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:54:51,269 INFO L93 Difference]: Finished difference Result 459 states and 706 transitions. [2025-03-17 00:54:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:54:51,270 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 00:54:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:54:51,272 INFO L225 Difference]: With dead ends: 459 [2025-03-17 00:54:51,272 INFO L226 Difference]: Without dead ends: 457 [2025-03-17 00:54:51,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-17 00:54:51,273 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 637 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:54:51,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1183 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 00:54:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-17 00:54:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 325. [2025-03-17 00:54:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 240 states have (on average 1.425) internal successors, (342), 240 states have internal predecessors, (342), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:54:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 504 transitions. [2025-03-17 00:54:51,291 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 504 transitions. Word has length 172 [2025-03-17 00:54:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:54:51,292 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 504 transitions. [2025-03-17 00:54:51,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 00:54:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 504 transitions. [2025-03-17 00:54:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:54:51,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:54:51,294 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:54:51,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:54:51,294 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:54:51,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:54:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash -648962743, now seen corresponding path program 1 times [2025-03-17 00:54:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:54:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784090635] [2025-03-17 00:54:51,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:54:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:54:51,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:54:51,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:54:51,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:54:51,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:54:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 00:54:57,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:54:57,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784090635] [2025-03-17 00:54:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784090635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:54:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:54:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 00:54:57,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694446010] [2025-03-17 00:54:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:54:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 00:54:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:54:57,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 00:54:57,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:54:57,527 INFO L87 Difference]: Start difference. First operand 325 states and 504 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 00:55:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:55:03,215 INFO L93 Difference]: Finished difference Result 459 states and 706 transitions. [2025-03-17 00:55:03,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 00:55:03,215 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2025-03-17 00:55:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:55:03,217 INFO L225 Difference]: With dead ends: 459 [2025-03-17 00:55:03,217 INFO L226 Difference]: Without dead ends: 457 [2025-03-17 00:55:03,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=266, Invalid=726, Unknown=0, NotChecked=0, Total=992 [2025-03-17 00:55:03,218 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 669 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:55:03,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1259 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 00:55:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-17 00:55:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 331. [2025-03-17 00:55:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 246 states have (on average 1.4227642276422765) internal successors, (350), 246 states have internal predecessors, (350), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:55:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 512 transitions. [2025-03-17 00:55:03,231 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 512 transitions. Word has length 172 [2025-03-17 00:55:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:55:03,231 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 512 transitions. [2025-03-17 00:55:03,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 00:55:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 512 transitions. [2025-03-17 00:55:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 00:55:03,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:55:03,233 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:55:03,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:55:03,233 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:55:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:55:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash -914046008, now seen corresponding path program 1 times [2025-03-17 00:55:03,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:55:03,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054076244] [2025-03-17 00:55:03,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:55:03,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:55:03,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 00:55:03,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 00:55:03,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:55:03,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat