./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.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 330035e885fa245249a9985bfeff9cf400ee4543a6b7e2fb380a386ceeec5a9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:06:21,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:06:21,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:06:21,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:06:21,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:06:21,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:06:21,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:06:21,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:06:21,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:06:21,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:06:21,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:06:21,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:06:21,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:06:21,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:06:21,680 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:06:21,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:06:21,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:06:21,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:06:21,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:06:21,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:06:21,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:06:21,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:06:21,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:06:21,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:06:21,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:06:21,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:06:21,683 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 -> 330035e885fa245249a9985bfeff9cf400ee4543a6b7e2fb380a386ceeec5a9f [2025-03-08 13:06:21,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:06:21,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:06:21,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:06:21,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:06:21,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:06:21,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i [2025-03-08 13:06:23,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd64f3b9/b4079a6baa664bcda180e415455a52de/FLAG41d51b0be [2025-03-08 13:06:23,276 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:06:23,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i [2025-03-08 13:06:23,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd64f3b9/b4079a6baa664bcda180e415455a52de/FLAG41d51b0be [2025-03-08 13:06:23,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccd64f3b9/b4079a6baa664bcda180e415455a52de [2025-03-08 13:06:23,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:06:23,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:06:23,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:06:23,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:06:23,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:06:23,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d4c2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23, skipping insertion in model container [2025-03-08 13:06:23,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:06:23,686 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i[919,932] [2025-03-08 13:06:23,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:06:23,739 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:06:23,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i[919,932] [2025-03-08 13:06:23,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:06:23,789 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:06:23,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23 WrapperNode [2025-03-08 13:06:23,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:06:23,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:06:23,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:06:23,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:06:23,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,838 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-03-08 13:06:23,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:06:23,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:06:23,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:06:23,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:06:23,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:06:23,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:06:23,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:06:23,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:06:23,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:06:23,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (1/1) ... [2025-03-08 13:06:23,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:06:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:06:23,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:06:23,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:06:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:06:23,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:06:23,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:06:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:06:23,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:06:23,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:06:23,986 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:06:23,988 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:06:24,381 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-08 13:06:24,423 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 13:06:24,424 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:06:24,440 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:06:24,441 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:06:24,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:06:24 BoogieIcfgContainer [2025-03-08 13:06:24,441 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:06:24,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:06:24,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:06:24,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:06:24,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:06:23" (1/3) ... [2025-03-08 13:06:24,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640101d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:06:24, skipping insertion in model container [2025-03-08 13:06:24,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:06:23" (2/3) ... [2025-03-08 13:06:24,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640101d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:06:24, skipping insertion in model container [2025-03-08 13:06:24,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:06:24" (3/3) ... [2025-03-08 13:06:24,449 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i [2025-03-08 13:06:24,459 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:06:24,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-81.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:06:24,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:06:24,510 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;@3b8154bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:06:24,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:06:24,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 13:06:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-08 13:06:24,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:06:24,529 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:06:24,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:06:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:06:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1781539901, now seen corresponding path program 1 times [2025-03-08 13:06:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:06:24,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341408287] [2025-03-08 13:06:24,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:06:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 13:06:24,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 13:06:24,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:24,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:06:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-08 13:06:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:06:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341408287] [2025-03-08 13:06:24,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341408287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:06:24,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006490394] [2025-03-08 13:06:24,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:06:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:06:24,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:06:24,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:06:24,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 13:06:25,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 13:06:25,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:25,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:06:25,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:06:25,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:06:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-08 13:06:25,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:06:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006490394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:06:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:06:25,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:06:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833965907] [2025-03-08 13:06:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:06:25,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:06:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:06:25,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:06:25,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:06:25,123 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 13:06:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:06:25,153 INFO L93 Difference]: Finished difference Result 260 states and 471 transitions. [2025-03-08 13:06:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:06:25,155 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 306 [2025-03-08 13:06:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:06:25,160 INFO L225 Difference]: With dead ends: 260 [2025-03-08 13:06:25,161 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 13:06:25,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:06:25,165 INFO L435 NwaCegarLoop]: 204 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, 204 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-08 13:06:25,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:06:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 13:06:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-08 13:06:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 13:06:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 208 transitions. [2025-03-08 13:06:25,208 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 208 transitions. Word has length 306 [2025-03-08 13:06:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:06:25,208 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 208 transitions. [2025-03-08 13:06:25,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 13:06:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 208 transitions. [2025-03-08 13:06:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-08 13:06:25,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:06:25,215 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:06:25,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 13:06:25,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:06:25,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:06:25,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:06:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1348890721, now seen corresponding path program 1 times [2025-03-08 13:06:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:06:25,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524884210] [2025-03-08 13:06:25,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:06:25,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-08 13:06:25,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-08 13:06:25,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:25,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:06:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:06:26,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:06:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524884210] [2025-03-08 13:06:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524884210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:06:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:06:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 13:06:26,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282098088] [2025-03-08 13:06:26,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:06:26,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:06:26,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:06:26,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:06:26,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 13:06:26,569 INFO L87 Difference]: Start difference. First operand 130 states and 208 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:06:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:06:27,212 INFO L93 Difference]: Finished difference Result 485 states and 764 transitions. [2025-03-08 13:06:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 13:06:27,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2025-03-08 13:06:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:06:27,216 INFO L225 Difference]: With dead ends: 485 [2025-03-08 13:06:27,216 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 13:06:27,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 13:06:27,220 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 396 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:06:27,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 695 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 13:06:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 13:06:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 137. [2025-03-08 13:06:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 13:06:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 216 transitions. [2025-03-08 13:06:27,256 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 216 transitions. Word has length 306 [2025-03-08 13:06:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:06:27,256 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 216 transitions. [2025-03-08 13:06:27,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:06:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 216 transitions. [2025-03-08 13:06:27,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 13:06:27,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:06:27,263 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:06:27,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:06:27,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:06:27,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:06:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1216844947, now seen corresponding path program 1 times [2025-03-08 13:06:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:06:27,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748903398] [2025-03-08 13:06:27,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:06:27,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 13:06:27,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 13:06:27,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:27,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:06:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:06:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:06:35,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748903398] [2025-03-08 13:06:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748903398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:06:35,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:06:35,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:06:35,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247405244] [2025-03-08 13:06:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:06:35,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:06:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:06:35,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:06:35,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:06:35,684 INFO L87 Difference]: Start difference. First operand 137 states and 216 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:06:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:06:37,961 INFO L93 Difference]: Finished difference Result 513 states and 795 transitions. [2025-03-08 13:06:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:06:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 13:06:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:06:37,965 INFO L225 Difference]: With dead ends: 513 [2025-03-08 13:06:37,966 INFO L226 Difference]: Without dead ends: 379 [2025-03-08 13:06:37,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-08 13:06:37,967 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 709 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:06:37,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1139 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 13:06:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-08 13:06:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 260. [2025-03-08 13:06:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 155 states have (on average 1.3741935483870968) internal successors, (213), 155 states have internal predecessors, (213), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:06:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 413 transitions. [2025-03-08 13:06:38,013 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 413 transitions. Word has length 307 [2025-03-08 13:06:38,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:06:38,013 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 413 transitions. [2025-03-08 13:06:38,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:06:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 413 transitions. [2025-03-08 13:06:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 13:06:38,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:06:38,016 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:06:38,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:06:38,016 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:06:38,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:06:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1413358452, now seen corresponding path program 1 times [2025-03-08 13:06:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:06:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495447410] [2025-03-08 13:06:38,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:06:38,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 13:06:38,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 13:06:38,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:38,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:06:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:06:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:06:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495447410] [2025-03-08 13:06:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495447410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:06:38,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:06:38,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:06:38,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519953172] [2025-03-08 13:06:38,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:06:38,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:06:38,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:06:38,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:06:38,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:06:38,250 INFO L87 Difference]: Start difference. First operand 260 states and 413 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:06:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:06:38,330 INFO L93 Difference]: Finished difference Result 429 states and 675 transitions. [2025-03-08 13:06:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:06:38,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 13:06:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:06:38,333 INFO L225 Difference]: With dead ends: 429 [2025-03-08 13:06:38,333 INFO L226 Difference]: Without dead ends: 295 [2025-03-08 13:06:38,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:06:38,336 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 42 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:06:38,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 602 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:06:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-08 13:06:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2025-03-08 13:06:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 183 states have internal predecessors, (249), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:06:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 457 transitions. [2025-03-08 13:06:38,372 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 457 transitions. Word has length 307 [2025-03-08 13:06:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:06:38,374 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 457 transitions. [2025-03-08 13:06:38,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:06:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 457 transitions. [2025-03-08 13:06:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 13:06:38,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:06:38,376 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:06:38,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:06:38,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:06:38,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:06:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1281170990, now seen corresponding path program 1 times [2025-03-08 13:06:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:06:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567084021] [2025-03-08 13:06:38,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:06:38,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 13:06:38,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 13:06:38,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:38,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:06:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:06:45,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:06:45,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567084021] [2025-03-08 13:06:45,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567084021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:06:45,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:06:45,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 13:06:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143272860] [2025-03-08 13:06:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:06:45,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 13:06:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:06:45,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 13:06:45,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:06:45,850 INFO L87 Difference]: Start difference. First operand 292 states and 457 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 13:06:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:06:48,059 INFO L93 Difference]: Finished difference Result 565 states and 862 transitions. [2025-03-08 13:06:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 13:06:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2025-03-08 13:06:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:06:48,063 INFO L225 Difference]: With dead ends: 565 [2025-03-08 13:06:48,063 INFO L226 Difference]: Without dead ends: 399 [2025-03-08 13:06:48,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-08 13:06:48,065 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 660 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:06:48,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1128 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 13:06:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-08 13:06:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 292. [2025-03-08 13:06:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 183 states have internal predecessors, (249), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:06:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 457 transitions. [2025-03-08 13:06:48,099 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 457 transitions. Word has length 307 [2025-03-08 13:06:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:06:48,100 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 457 transitions. [2025-03-08 13:06:48,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 13:06:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 457 transitions. [2025-03-08 13:06:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 13:06:48,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:06:48,103 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:06:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:06:48,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:06:48,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:06:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1087762228, now seen corresponding path program 1 times [2025-03-08 13:06:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:06:48,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917824572] [2025-03-08 13:06:48,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:06:48,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 13:06:48,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 13:06:48,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:48,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:06:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:06:48,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:06:48,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917824572] [2025-03-08 13:06:48,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917824572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:06:48,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:06:48,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:06:48,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920490484] [2025-03-08 13:06:48,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:06:48,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:06:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:06:48,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:06:48,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:06:48,898 INFO L87 Difference]: Start difference. First operand 292 states and 457 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 13:06:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:06:49,926 INFO L93 Difference]: Finished difference Result 585 states and 898 transitions. [2025-03-08 13:06:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:06:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 307 [2025-03-08 13:06:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:06:49,929 INFO L225 Difference]: With dead ends: 585 [2025-03-08 13:06:49,929 INFO L226 Difference]: Without dead ends: 419 [2025-03-08 13:06:49,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:06:49,930 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 546 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:06:49,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 908 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:06:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-08 13:06:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 296. [2025-03-08 13:06:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 187 states have internal predecessors, (254), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:06:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2025-03-08 13:06:49,956 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 307 [2025-03-08 13:06:49,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:06:49,961 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2025-03-08 13:06:49,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 13:06:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2025-03-08 13:06:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 13:06:49,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:06:49,962 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:06:49,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:06:49,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:06:49,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:06:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1722403572, now seen corresponding path program 1 times [2025-03-08 13:06:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:06:49,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249336911] [2025-03-08 13:06:49,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:06:49,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 13:06:50,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 13:06:50,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:50,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:06:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:06:56,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:06:56,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249336911] [2025-03-08 13:06:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249336911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:06:56,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:06:56,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:06:56,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987524601] [2025-03-08 13:06:56,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:06:56,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:06:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:06:56,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:06:56,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:06:56,552 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:06:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:06:57,413 INFO L93 Difference]: Finished difference Result 576 states and 876 transitions. [2025-03-08 13:06:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 13:06:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 13:06:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:06:57,416 INFO L225 Difference]: With dead ends: 576 [2025-03-08 13:06:57,416 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 13:06:57,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:06:57,418 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 381 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:06:57,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 919 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:06:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 13:06:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 299. [2025-03-08 13:06:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 189 states have (on average 1.3703703703703705) internal successors, (259), 190 states have internal predecessors, (259), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:06:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 467 transitions. [2025-03-08 13:06:57,454 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 467 transitions. Word has length 307 [2025-03-08 13:06:57,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:06:57,454 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 467 transitions. [2025-03-08 13:06:57,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:06:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 467 transitions. [2025-03-08 13:06:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 13:06:57,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:06:57,459 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:06:57,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 13:06:57,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:06:57,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:06:57,460 INFO L85 PathProgramCache]: Analyzing trace with hash 775612365, now seen corresponding path program 1 times [2025-03-08 13:06:57,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:06:57,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031369340] [2025-03-08 13:06:57,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:06:57,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:06:57,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 13:06:57,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 13:06:57,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:06:57,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:04,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:04,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031369340] [2025-03-08 13:07:04,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031369340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:04,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:04,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:07:04,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033798396] [2025-03-08 13:07:04,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:04,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:07:04,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:04,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:07:04,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:07:04,644 INFO L87 Difference]: Start difference. First operand 299 states and 467 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:04,999 INFO L93 Difference]: Finished difference Result 505 states and 778 transitions. [2025-03-08 13:07:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:07:05,000 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 13:07:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:05,002 INFO L225 Difference]: With dead ends: 505 [2025-03-08 13:07:05,002 INFO L226 Difference]: Without dead ends: 339 [2025-03-08 13:07:05,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:07:05,004 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 150 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:05,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 718 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:07:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-08 13:07:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 296. [2025-03-08 13:07:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 187 states have internal predecessors, (254), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:07:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2025-03-08 13:07:05,027 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 307 [2025-03-08 13:07:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:05,027 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2025-03-08 13:07:05,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2025-03-08 13:07:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-08 13:07:05,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:05,029 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:05,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 13:07:05,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:05,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1593320853, now seen corresponding path program 1 times [2025-03-08 13:07:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:05,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223082851] [2025-03-08 13:07:05,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:05,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:05,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-08 13:07:05,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-08 13:07:05,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:05,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:05,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:05,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223082851] [2025-03-08 13:07:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223082851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:05,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:05,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 13:07:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479923904] [2025-03-08 13:07:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:05,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:07:05,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:05,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:07:05,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:07:05,434 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:05,941 INFO L93 Difference]: Finished difference Result 525 states and 810 transitions. [2025-03-08 13:07:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 13:07:05,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-03-08 13:07:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:05,944 INFO L225 Difference]: With dead ends: 525 [2025-03-08 13:07:05,944 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 13:07:05,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:07:05,946 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 175 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:05,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 854 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 13:07:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 13:07:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 296. [2025-03-08 13:07:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 186 states have (on average 1.3655913978494623) internal successors, (254), 187 states have internal predecessors, (254), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:07:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2025-03-08 13:07:05,975 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 307 [2025-03-08 13:07:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:05,976 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2025-03-08 13:07:05,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2025-03-08 13:07:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 13:07:05,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:05,978 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:05,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 13:07:05,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:05,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash 644967490, now seen corresponding path program 1 times [2025-03-08 13:07:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:05,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108165575] [2025-03-08 13:07:05,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:05,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:05,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 13:07:06,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 13:07:06,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:06,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108165575] [2025-03-08 13:07:11,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108165575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:11,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:11,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:07:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082466667] [2025-03-08 13:07:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:07:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:07:11,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:07:11,534 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:12,036 INFO L93 Difference]: Finished difference Result 613 states and 931 transitions. [2025-03-08 13:07:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 13:07:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 13:07:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:12,039 INFO L225 Difference]: With dead ends: 613 [2025-03-08 13:07:12,039 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 13:07:12,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:07:12,040 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 214 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:12,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 744 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 13:07:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 13:07:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 304. [2025-03-08 13:07:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 194 states have (on average 1.3762886597938144) internal successors, (267), 195 states have internal predecessors, (267), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:07:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 475 transitions. [2025-03-08 13:07:12,066 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 475 transitions. Word has length 308 [2025-03-08 13:07:12,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:12,067 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 475 transitions. [2025-03-08 13:07:12,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 475 transitions. [2025-03-08 13:07:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 13:07:12,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:12,068 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:12,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 13:07:12,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:12,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash 448453985, now seen corresponding path program 1 times [2025-03-08 13:07:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007169772] [2025-03-08 13:07:12,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:12,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 13:07:12,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 13:07:12,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:12,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:17,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007169772] [2025-03-08 13:07:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007169772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:17,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:07:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614256499] [2025-03-08 13:07:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:07:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:17,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:07:17,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:07:17,100 INFO L87 Difference]: Start difference. First operand 304 states and 475 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:17,595 INFO L93 Difference]: Finished difference Result 605 states and 922 transitions. [2025-03-08 13:07:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:07:17,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 13:07:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:17,599 INFO L225 Difference]: With dead ends: 605 [2025-03-08 13:07:17,599 INFO L226 Difference]: Without dead ends: 424 [2025-03-08 13:07:17,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:07:17,601 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 185 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:17,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 970 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 13:07:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-08 13:07:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 312. [2025-03-08 13:07:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 202 states have (on average 1.3762376237623761) internal successors, (278), 203 states have internal predecessors, (278), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:07:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 486 transitions. [2025-03-08 13:07:17,628 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 486 transitions. Word has length 308 [2025-03-08 13:07:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:17,629 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 486 transitions. [2025-03-08 13:07:17,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 486 transitions. [2025-03-08 13:07:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 13:07:17,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:17,630 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:17,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 13:07:17,631 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:17,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1151983869, now seen corresponding path program 1 times [2025-03-08 13:07:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458386624] [2025-03-08 13:07:17,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:17,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 13:07:17,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 13:07:17,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:17,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:21,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:21,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458386624] [2025-03-08 13:07:21,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458386624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:21,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:21,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 13:07:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245116983] [2025-03-08 13:07:21,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:21,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:07:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:21,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:07:21,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:07:21,927 INFO L87 Difference]: Start difference. First operand 312 states and 486 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:25,906 INFO L93 Difference]: Finished difference Result 708 states and 1062 transitions. [2025-03-08 13:07:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 13:07:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 13:07:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:25,909 INFO L225 Difference]: With dead ends: 708 [2025-03-08 13:07:25,909 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 13:07:25,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-03-08 13:07:25,911 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 520 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:25,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1164 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 13:07:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 13:07:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 316. [2025-03-08 13:07:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 206 states have (on average 1.3786407766990292) internal successors, (284), 207 states have internal predecessors, (284), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:07:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 492 transitions. [2025-03-08 13:07:25,962 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 492 transitions. Word has length 308 [2025-03-08 13:07:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:25,962 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 492 transitions. [2025-03-08 13:07:25,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 492 transitions. [2025-03-08 13:07:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 13:07:25,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:25,964 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:25,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 13:07:25,964 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:25,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1348497374, now seen corresponding path program 1 times [2025-03-08 13:07:25,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:25,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377345101] [2025-03-08 13:07:25,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:25,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:25,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 13:07:26,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 13:07:26,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:28,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:28,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377345101] [2025-03-08 13:07:28,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377345101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:28,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:28,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:07:28,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899606831] [2025-03-08 13:07:28,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:28,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:07:28,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:28,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:07:28,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:07:28,864 INFO L87 Difference]: Start difference. First operand 316 states and 492 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:29,236 INFO L93 Difference]: Finished difference Result 597 states and 912 transitions. [2025-03-08 13:07:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:07:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 13:07:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:29,239 INFO L225 Difference]: With dead ends: 597 [2025-03-08 13:07:29,239 INFO L226 Difference]: Without dead ends: 408 [2025-03-08 13:07:29,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:07:29,240 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 178 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:29,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 784 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:07:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-08 13:07:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 316. [2025-03-08 13:07:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 206 states have (on average 1.3786407766990292) internal successors, (284), 207 states have internal predecessors, (284), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:07:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 492 transitions. [2025-03-08 13:07:29,267 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 492 transitions. Word has length 308 [2025-03-08 13:07:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:29,267 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 492 transitions. [2025-03-08 13:07:29,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 492 transitions. [2025-03-08 13:07:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 13:07:29,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:29,269 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:29,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 13:07:29,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:29,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1657542494, now seen corresponding path program 1 times [2025-03-08 13:07:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:29,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001057537] [2025-03-08 13:07:29,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:29,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 13:07:29,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 13:07:29,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:29,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:33,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:33,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001057537] [2025-03-08 13:07:33,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001057537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:33,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:33,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:07:33,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963567242] [2025-03-08 13:07:33,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:33,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:07:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:33,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:07:33,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:07:33,786 INFO L87 Difference]: Start difference. First operand 316 states and 492 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:34,214 INFO L93 Difference]: Finished difference Result 574 states and 878 transitions. [2025-03-08 13:07:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 13:07:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 13:07:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:34,219 INFO L225 Difference]: With dead ends: 574 [2025-03-08 13:07:34,219 INFO L226 Difference]: Without dead ends: 384 [2025-03-08 13:07:34,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:07:34,220 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 226 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:34,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 612 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:07:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-08 13:07:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 312. [2025-03-08 13:07:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 202 states have (on average 1.3762376237623761) internal successors, (278), 203 states have internal predecessors, (278), 104 states have call successors, (104), 5 states have call predecessors, (104), 5 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 13:07:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 486 transitions. [2025-03-08 13:07:34,247 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 486 transitions. Word has length 308 [2025-03-08 13:07:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:34,248 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 486 transitions. [2025-03-08 13:07:34,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 486 transitions. [2025-03-08 13:07:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 13:07:34,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:34,250 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:34,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 13:07:34,251 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:34,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2142447997, now seen corresponding path program 1 times [2025-03-08 13:07:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005728707] [2025-03-08 13:07:34,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:34,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 13:07:34,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 13:07:34,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:34,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:34,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005728707] [2025-03-08 13:07:34,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005728707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:34,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:34,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:07:34,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693569567] [2025-03-08 13:07:34,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:34,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:07:34,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:34,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:07:34,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:07:34,433 INFO L87 Difference]: Start difference. First operand 312 states and 486 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:34,513 INFO L93 Difference]: Finished difference Result 528 states and 810 transitions. [2025-03-08 13:07:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:07:34,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 13:07:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:34,516 INFO L225 Difference]: With dead ends: 528 [2025-03-08 13:07:34,516 INFO L226 Difference]: Without dead ends: 339 [2025-03-08 13:07:34,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:07:34,519 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 61 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:34,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 607 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:07:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-08 13:07:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 299. [2025-03-08 13:07:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 192 states have (on average 1.375) internal successors, (264), 192 states have internal predecessors, (264), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:07:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 464 transitions. [2025-03-08 13:07:34,543 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 464 transitions. Word has length 308 [2025-03-08 13:07:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:34,544 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 464 transitions. [2025-03-08 13:07:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 464 transitions. [2025-03-08 13:07:34,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 13:07:34,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:34,545 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:34,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 13:07:34,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:34,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:34,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1956005794, now seen corresponding path program 1 times [2025-03-08 13:07:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:34,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352723606] [2025-03-08 13:07:34,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:34,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 13:07:34,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 13:07:34,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:34,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:39,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:39,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352723606] [2025-03-08 13:07:39,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352723606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:39,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:39,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:07:39,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316940837] [2025-03-08 13:07:39,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:39,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:07:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:39,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:07:39,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:07:39,549 INFO L87 Difference]: Start difference. First operand 299 states and 464 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:40,274 INFO L93 Difference]: Finished difference Result 531 states and 810 transitions. [2025-03-08 13:07:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:07:40,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-03-08 13:07:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:40,278 INFO L225 Difference]: With dead ends: 531 [2025-03-08 13:07:40,278 INFO L226 Difference]: Without dead ends: 359 [2025-03-08 13:07:40,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:07:40,280 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 158 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:40,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 933 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:07:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-08 13:07:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 301. [2025-03-08 13:07:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 194 states have (on average 1.3762886597938144) internal successors, (267), 194 states have internal predecessors, (267), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:07:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 467 transitions. [2025-03-08 13:07:40,322 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 467 transitions. Word has length 308 [2025-03-08 13:07:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:40,322 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 467 transitions. [2025-03-08 13:07:40,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 13:07:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 467 transitions. [2025-03-08 13:07:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-08 13:07:40,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:40,325 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:40,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 13:07:40,325 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:40,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash 159054435, now seen corresponding path program 1 times [2025-03-08 13:07:40,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:40,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695734824] [2025-03-08 13:07:40,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:40,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-08 13:07:40,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-08 13:07:40,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:40,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:07:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 13:07:45,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:07:45,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695734824] [2025-03-08 13:07:45,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695734824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:07:45,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:07:45,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 13:07:45,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33262317] [2025-03-08 13:07:45,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:07:45,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:07:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:07:45,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:07:45,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:07:45,932 INFO L87 Difference]: Start difference. First operand 301 states and 467 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 13:07:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:07:47,223 INFO L93 Difference]: Finished difference Result 534 states and 817 transitions. [2025-03-08 13:07:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 13:07:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-03-08 13:07:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:07:47,226 INFO L225 Difference]: With dead ends: 534 [2025-03-08 13:07:47,226 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 13:07:47,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2025-03-08 13:07:47,227 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 266 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 13:07:47,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1252 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 13:07:47,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 13:07:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 302. [2025-03-08 13:07:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 195 states have (on average 1.3794871794871795) internal successors, (269), 195 states have internal predecessors, (269), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:07:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 469 transitions. [2025-03-08 13:07:47,253 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 469 transitions. Word has length 308 [2025-03-08 13:07:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:07:47,253 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 469 transitions. [2025-03-08 13:07:47,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 13:07:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 469 transitions. [2025-03-08 13:07:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-08 13:07:47,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:07:47,255 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:07:47,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 13:07:47,255 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:07:47,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:07:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1983288789, now seen corresponding path program 1 times [2025-03-08 13:07:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:07:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619670543] [2025-03-08 13:07:47,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:07:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:07:47,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 13:07:47,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 13:07:47,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:07:47,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat