./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.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 8880bc6b55ab6b26a36a9709c52577c78f4355aea8bee56c9643da00ec93f3ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:57:30,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:57:30,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:57:30,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:57:30,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:57:30,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:57:30,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:57:30,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:57:30,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:57:30,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:57:30,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:57:30,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:57:30,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:57:30,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:57:30,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:57:30,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:57:30,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:57:30,110 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 -> 8880bc6b55ab6b26a36a9709c52577c78f4355aea8bee56c9643da00ec93f3ee [2025-03-03 21:57:30,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:57:30,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:57:30,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:57:30,353 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:57:30,353 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:57:30,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2025-03-03 21:57:31,586 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726422eb8/aca11ee7073f4208bff626f429ccbf20/FLAG8fc171671 [2025-03-03 21:57:31,858 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:57:31,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2025-03-03 21:57:31,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726422eb8/aca11ee7073f4208bff626f429ccbf20/FLAG8fc171671 [2025-03-03 21:57:31,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/726422eb8/aca11ee7073f4208bff626f429ccbf20 [2025-03-03 21:57:31,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:57:31,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:57:31,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:57:31,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:57:31,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:57:31,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:57:31" (1/1) ... [2025-03-03 21:57:31,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:31, skipping insertion in model container [2025-03-03 21:57:31,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:57:31" (1/1) ... [2025-03-03 21:57:31,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:57:32,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i[919,932] [2025-03-03 21:57:32,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:57:32,087 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:57:32,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i[919,932] [2025-03-03 21:57:32,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:57:32,141 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:57:32,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32 WrapperNode [2025-03-03 21:57:32,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:57:32,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:57:32,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:57:32,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:57:32,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,191 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 315 [2025-03-03 21:57:32,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:57:32,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:57:32,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:57:32,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:57:32,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,236 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-03 21:57:32,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:57:32,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:57:32,256 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:57:32,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:57:32,257 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (1/1) ... [2025-03-03 21:57:32,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:57:32,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:57:32,284 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-03 21:57:32,289 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-03 21:57:32,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:57:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:57:32,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:57:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:57:32,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:57:32,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:57:32,376 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:57:32,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:57:32,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L211: havoc property_#t~bitwise35#1;havoc property_#t~ite37#1;havoc property_#t~bitwise36#1;havoc property_#t~short38#1; [2025-03-03 21:57:32,839 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-03 21:57:32,840 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:57:32,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:57:32,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:57:32,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:57:32 BoogieIcfgContainer [2025-03-03 21:57:32,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:57:32,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:57:32,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:57:32,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:57:32,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:57:31" (1/3) ... [2025-03-03 21:57:32,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d5185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:57:32, skipping insertion in model container [2025-03-03 21:57:32,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:57:32" (2/3) ... [2025-03-03 21:57:32,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d5185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:57:32, skipping insertion in model container [2025-03-03 21:57:32,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:57:32" (3/3) ... [2025-03-03 21:57:32,873 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2025-03-03 21:57:32,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:57:32,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:57:32,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:57:32,935 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;@bdc872d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:57:32,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:57:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 94 states have internal predecessors, (132), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 21:57:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 21:57:32,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:57:32,956 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:57:32,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:57:32,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:57:32,960 INFO L85 PathProgramCache]: Analyzing trace with hash -965920358, now seen corresponding path program 1 times [2025-03-03 21:57:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:57:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697074544] [2025-03-03 21:57:32,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:57:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:57:33,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 21:57:33,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 21:57:33,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:57:33,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:57:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-03 21:57:33,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:57:33,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697074544] [2025-03-03 21:57:33,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697074544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:57:33,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255734003] [2025-03-03 21:57:33,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:57:33,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:57:33,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:57:33,365 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-03 21:57:33,367 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-03 21:57:33,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 21:57:33,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 21:57:33,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:57:33,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:57:33,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:57:33,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:57:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2025-03-03 21:57:33,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:57:33,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255734003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:57:33,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:57:33,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:57:33,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164174085] [2025-03-03 21:57:33,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:57:33,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:57:33,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:57:33,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:57:33,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:57:33,610 INFO L87 Difference]: Start difference. First operand has 138 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 94 states have internal predecessors, (132), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:57:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:57:33,658 INFO L93 Difference]: Finished difference Result 270 states and 469 transitions. [2025-03-03 21:57:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:57:33,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 263 [2025-03-03 21:57:33,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:57:33,667 INFO L225 Difference]: With dead ends: 270 [2025-03-03 21:57:33,668 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 21:57:33,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 264 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-03 21:57:33,675 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:57:33,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:57:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 21:57:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-03 21:57:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 21:57:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2025-03-03 21:57:33,718 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 263 [2025-03-03 21:57:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:57:33,718 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2025-03-03 21:57:33,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:57:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2025-03-03 21:57:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 21:57:33,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:57:33,724 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:57:33,731 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-03 21:57:33,924 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-03 21:57:33,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:57:33,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:57:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2107124290, now seen corresponding path program 1 times [2025-03-03 21:57:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:57:33,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074385738] [2025-03-03 21:57:33,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:57:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:57:33,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 21:57:34,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 21:57:34,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:57:34,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:57:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:57:34,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:57:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074385738] [2025-03-03 21:57:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074385738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:57:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:57:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:57:34,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750166368] [2025-03-03 21:57:34,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:57:34,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:57:34,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:57:34,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:57:34,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:57:34,547 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:57:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:57:34,646 INFO L93 Difference]: Finished difference Result 368 states and 582 transitions. [2025-03-03 21:57:34,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:57:34,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-03-03 21:57:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:57:34,649 INFO L225 Difference]: With dead ends: 368 [2025-03-03 21:57:34,651 INFO L226 Difference]: Without dead ends: 236 [2025-03-03 21:57:34,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:57:34,653 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 91 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:57:34,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 385 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:57:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-03 21:57:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 216. [2025-03-03 21:57:34,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 129 states have (on average 1.3255813953488371) internal successors, (171), 129 states have internal predecessors, (171), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:57:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 339 transitions. [2025-03-03 21:57:34,697 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 339 transitions. Word has length 263 [2025-03-03 21:57:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:57:34,698 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 339 transitions. [2025-03-03 21:57:34,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:57:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 339 transitions. [2025-03-03 21:57:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 21:57:34,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:57:34,702 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:57:34,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:57:34,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:57:34,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:57:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash -929366562, now seen corresponding path program 1 times [2025-03-03 21:57:34,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:57:34,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369736712] [2025-03-03 21:57:34,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:57:34,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:57:34,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 21:57:34,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 21:57:34,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:57:34,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:57:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:57:35,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:57:35,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369736712] [2025-03-03 21:57:35,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369736712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:57:35,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:57:35,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:57:35,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075539044] [2025-03-03 21:57:35,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:57:35,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:57:35,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:57:35,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:57:35,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:57:35,129 INFO L87 Difference]: Start difference. First operand 216 states and 339 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:57:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:57:35,387 INFO L93 Difference]: Finished difference Result 400 states and 625 transitions. [2025-03-03 21:57:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:57:35,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2025-03-03 21:57:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:57:35,391 INFO L225 Difference]: With dead ends: 400 [2025-03-03 21:57:35,393 INFO L226 Difference]: Without dead ends: 268 [2025-03-03 21:57:35,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:57:35,394 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 164 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:57:35,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 577 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:57:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-03 21:57:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 234. [2025-03-03 21:57:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 147 states have (on average 1.3537414965986394) internal successors, (199), 147 states have internal predecessors, (199), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 21:57:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 367 transitions. [2025-03-03 21:57:35,452 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 367 transitions. Word has length 263 [2025-03-03 21:57:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:57:35,453 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 367 transitions. [2025-03-03 21:57:35,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:57:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 367 transitions. [2025-03-03 21:57:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 21:57:35,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:57:35,457 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:57:35,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:57:35,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:57:35,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:57:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1606653543, now seen corresponding path program 1 times [2025-03-03 21:57:35,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:57:35,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013424824] [2025-03-03 21:57:35,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:57:35,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:57:35,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 21:57:35,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 21:57:35,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:57:35,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:57:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:57:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:57:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013424824] [2025-03-03 21:57:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013424824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:57:55,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:57:55,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:57:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857046575] [2025-03-03 21:57:55,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:57:55,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:57:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:57:55,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:57:55,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:57:55,092 INFO L87 Difference]: Start difference. First operand 234 states and 367 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 21:57:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:57:58,345 INFO L93 Difference]: Finished difference Result 639 states and 964 transitions. [2025-03-03 21:57:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:57:58,345 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 264 [2025-03-03 21:57:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:57:58,349 INFO L225 Difference]: With dead ends: 639 [2025-03-03 21:57:58,349 INFO L226 Difference]: Without dead ends: 507 [2025-03-03 21:57:58,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-03 21:57:58,350 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 879 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:57:58,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1331 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 21:57:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-03 21:57:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 376. [2025-03-03 21:57:58,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 241 states have (on average 1.3112033195020747) internal successors, (316), 242 states have internal predecessors, (316), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 21:57:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 568 transitions. [2025-03-03 21:57:58,390 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 568 transitions. Word has length 264 [2025-03-03 21:57:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:57:58,390 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 568 transitions. [2025-03-03 21:57:58,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 21:57:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 568 transitions. [2025-03-03 21:57:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 21:57:58,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:57:58,392 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:57:58,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:57:58,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:57:58,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:57:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1477570824, now seen corresponding path program 1 times [2025-03-03 21:57:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:57:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657884183] [2025-03-03 21:57:58,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:57:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:57:58,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 21:57:58,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 21:57:58,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:57:58,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:01,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657884183] [2025-03-03 21:58:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657884183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:01,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 21:58:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944064630] [2025-03-03 21:58:01,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:01,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:58:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:01,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:58:01,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:58:01,412 INFO L87 Difference]: Start difference. First operand 376 states and 568 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:02,758 INFO L93 Difference]: Finished difference Result 765 states and 1142 transitions. [2025-03-03 21:58:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:58:02,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-03-03 21:58:02,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:02,762 INFO L225 Difference]: With dead ends: 765 [2025-03-03 21:58:02,763 INFO L226 Difference]: Without dead ends: 470 [2025-03-03 21:58:02,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:58:02,765 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 512 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:02,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1292 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:58:02,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-03 21:58:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 380. [2025-03-03 21:58:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 245 states have (on average 1.310204081632653) internal successors, (321), 246 states have internal predecessors, (321), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 21:58:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 573 transitions. [2025-03-03 21:58:02,790 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 573 transitions. Word has length 264 [2025-03-03 21:58:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:02,790 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 573 transitions. [2025-03-03 21:58:02,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 573 transitions. [2025-03-03 21:58:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 21:58:02,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:02,793 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:02,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:58:02,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:02,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 370325113, now seen corresponding path program 1 times [2025-03-03 21:58:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:02,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012095525] [2025-03-03 21:58:02,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:02,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 21:58:02,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 21:58:02,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:02,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:05,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:05,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012095525] [2025-03-03 21:58:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012095525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:05,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:05,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:58:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921323412] [2025-03-03 21:58:05,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:05,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:58:05,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:05,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:58:05,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:58:05,097 INFO L87 Difference]: Start difference. First operand 380 states and 573 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:58:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:06,488 INFO L93 Difference]: Finished difference Result 771 states and 1145 transitions. [2025-03-03 21:58:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:58:06,489 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 264 [2025-03-03 21:58:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:06,492 INFO L225 Difference]: With dead ends: 771 [2025-03-03 21:58:06,493 INFO L226 Difference]: Without dead ends: 472 [2025-03-03 21:58:06,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-03 21:58:06,496 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 485 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:06,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1725 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:58:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-03 21:58:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 388. [2025-03-03 21:58:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 253 states have (on average 1.308300395256917) internal successors, (331), 254 states have internal predecessors, (331), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 21:58:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 583 transitions. [2025-03-03 21:58:06,526 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 583 transitions. Word has length 264 [2025-03-03 21:58:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:06,526 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 583 transitions. [2025-03-03 21:58:06,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:58:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 583 transitions. [2025-03-03 21:58:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 21:58:06,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:06,528 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:06,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:58:06,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:06,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash 499407832, now seen corresponding path program 1 times [2025-03-03 21:58:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828835710] [2025-03-03 21:58:06,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:06,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 21:58:06,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 21:58:06,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:06,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828835710] [2025-03-03 21:58:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828835710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 21:58:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938676999] [2025-03-03 21:58:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:08,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 21:58:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:08,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 21:58:08,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:58:08,789 INFO L87 Difference]: Start difference. First operand 388 states and 583 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:10,890 INFO L93 Difference]: Finished difference Result 902 states and 1308 transitions. [2025-03-03 21:58:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:58:10,891 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-03-03 21:58:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:10,896 INFO L225 Difference]: With dead ends: 902 [2025-03-03 21:58:10,896 INFO L226 Difference]: Without dead ends: 595 [2025-03-03 21:58:10,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2025-03-03 21:58:10,898 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 597 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:10,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1670 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 21:58:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-03 21:58:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 387. [2025-03-03 21:58:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 252 states have (on average 1.3095238095238095) internal successors, (330), 253 states have internal predecessors, (330), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 21:58:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 582 transitions. [2025-03-03 21:58:10,935 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 582 transitions. Word has length 264 [2025-03-03 21:58:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:10,935 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 582 transitions. [2025-03-03 21:58:10,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 582 transitions. [2025-03-03 21:58:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 21:58:10,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:10,938 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:10,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:58:10,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 982952697, now seen corresponding path program 1 times [2025-03-03 21:58:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:10,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899569587] [2025-03-03 21:58:10,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:10,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 21:58:11,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 21:58:11,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:11,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:11,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899569587] [2025-03-03 21:58:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899569587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:11,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 21:58:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508192813] [2025-03-03 21:58:11,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:11,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:58:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:11,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:58:11,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:58:11,958 INFO L87 Difference]: Start difference. First operand 387 states and 582 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:12,646 INFO L93 Difference]: Finished difference Result 784 states and 1161 transitions. [2025-03-03 21:58:12,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:58:12,647 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-03-03 21:58:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:12,650 INFO L225 Difference]: With dead ends: 784 [2025-03-03 21:58:12,651 INFO L226 Difference]: Without dead ends: 478 [2025-03-03 21:58:12,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:58:12,653 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 376 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:12,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1248 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:58:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-03 21:58:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 382. [2025-03-03 21:58:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 247 states have (on average 1.3076923076923077) internal successors, (323), 248 states have internal predecessors, (323), 126 states have call successors, (126), 8 states have call predecessors, (126), 8 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 21:58:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 575 transitions. [2025-03-03 21:58:12,694 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 575 transitions. Word has length 264 [2025-03-03 21:58:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:12,695 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 575 transitions. [2025-03-03 21:58:12,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 575 transitions. [2025-03-03 21:58:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 21:58:12,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:12,697 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:12,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:58:12,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:12,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1691241400, now seen corresponding path program 1 times [2025-03-03 21:58:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:12,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619284209] [2025-03-03 21:58:12,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:12,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:12,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 21:58:12,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 21:58:12,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:12,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:15,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619284209] [2025-03-03 21:58:15,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619284209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:15,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:15,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 21:58:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093252456] [2025-03-03 21:58:15,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:15,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 21:58:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:15,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 21:58:15,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:58:15,779 INFO L87 Difference]: Start difference. First operand 382 states and 575 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:58:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:18,716 INFO L93 Difference]: Finished difference Result 877 states and 1308 transitions. [2025-03-03 21:58:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 21:58:18,717 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 264 [2025-03-03 21:58:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:18,720 INFO L225 Difference]: With dead ends: 877 [2025-03-03 21:58:18,721 INFO L226 Difference]: Without dead ends: 745 [2025-03-03 21:58:18,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2025-03-03 21:58:18,722 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 585 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:18,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1812 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 21:58:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-03 21:58:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 564. [2025-03-03 21:58:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 384 states have (on average 1.3385416666666667) internal successors, (514), 384 states have internal predecessors, (514), 168 states have call successors, (168), 11 states have call predecessors, (168), 11 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-03 21:58:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 850 transitions. [2025-03-03 21:58:18,753 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 850 transitions. Word has length 264 [2025-03-03 21:58:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:18,753 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 850 transitions. [2025-03-03 21:58:18,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:58:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 850 transitions. [2025-03-03 21:58:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 21:58:18,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:18,756 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:18,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 21:58:18,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:18,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:18,757 INFO L85 PathProgramCache]: Analyzing trace with hash -626747240, now seen corresponding path program 1 times [2025-03-03 21:58:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:18,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562224125] [2025-03-03 21:58:18,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:18,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 21:58:18,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 21:58:18,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:18,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562224125] [2025-03-03 21:58:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562224125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:19,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:19,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 21:58:19,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998072926] [2025-03-03 21:58:19,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:19,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 21:58:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:19,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 21:58:19,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:58:19,899 INFO L87 Difference]: Start difference. First operand 564 states and 850 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:20,611 INFO L93 Difference]: Finished difference Result 995 states and 1482 transitions. [2025-03-03 21:58:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:58:20,612 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2025-03-03 21:58:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:20,617 INFO L225 Difference]: With dead ends: 995 [2025-03-03 21:58:20,617 INFO L226 Difference]: Without dead ends: 709 [2025-03-03 21:58:20,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:58:20,619 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 335 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:20,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1662 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:58:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-03 21:58:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 566. [2025-03-03 21:58:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 386 states have (on average 1.3367875647668395) internal successors, (516), 386 states have internal predecessors, (516), 168 states have call successors, (168), 11 states have call predecessors, (168), 11 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-03 21:58:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 852 transitions. [2025-03-03 21:58:20,656 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 852 transitions. Word has length 264 [2025-03-03 21:58:20,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:20,656 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 852 transitions. [2025-03-03 21:58:20,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 852 transitions. [2025-03-03 21:58:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 21:58:20,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:20,658 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:20,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 21:58:20,658 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 110344216, now seen corresponding path program 1 times [2025-03-03 21:58:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:20,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591841565] [2025-03-03 21:58:20,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:20,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 21:58:20,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 21:58:20,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:20,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:25,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:25,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591841565] [2025-03-03 21:58:25,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591841565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:25,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:25,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 21:58:25,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692472117] [2025-03-03 21:58:25,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:25,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 21:58:25,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:25,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 21:58:25,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-03 21:58:25,356 INFO L87 Difference]: Start difference. First operand 566 states and 852 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 21:58:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:28,571 INFO L93 Difference]: Finished difference Result 839 states and 1248 transitions. [2025-03-03 21:58:28,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 21:58:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 265 [2025-03-03 21:58:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:28,575 INFO L225 Difference]: With dead ends: 839 [2025-03-03 21:58:28,575 INFO L226 Difference]: Without dead ends: 707 [2025-03-03 21:58:28,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2025-03-03 21:58:28,576 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 610 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 2220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:28,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1917 Invalid, 2220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 21:58:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-03 21:58:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 573. [2025-03-03 21:58:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 393 states have (on average 1.3384223918575064) internal successors, (526), 393 states have internal predecessors, (526), 168 states have call successors, (168), 11 states have call predecessors, (168), 11 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-03 21:58:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 862 transitions. [2025-03-03 21:58:28,606 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 862 transitions. Word has length 265 [2025-03-03 21:58:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:28,607 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 862 transitions. [2025-03-03 21:58:28,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 18 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 21:58:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 862 transitions. [2025-03-03 21:58:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 21:58:28,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:28,609 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:28,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 21:58:28,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:28,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash -183058791, now seen corresponding path program 1 times [2025-03-03 21:58:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:28,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963590895] [2025-03-03 21:58:28,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:28,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 21:58:28,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 21:58:28,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:28,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:28,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963590895] [2025-03-03 21:58:28,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963590895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:28,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:28,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:58:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135265233] [2025-03-03 21:58:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:28,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:58:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:28,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:58:28,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:58:28,758 INFO L87 Difference]: Start difference. First operand 573 states and 862 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:28,849 INFO L93 Difference]: Finished difference Result 1146 states and 1698 transitions. [2025-03-03 21:58:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:58:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 265 [2025-03-03 21:58:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:28,853 INFO L225 Difference]: With dead ends: 1146 [2025-03-03 21:58:28,853 INFO L226 Difference]: Without dead ends: 684 [2025-03-03 21:58:28,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:58:28,856 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 39 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:28,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 646 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:58:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-03-03 21:58:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 673. [2025-03-03 21:58:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 476 states have (on average 1.315126050420168) internal successors, (626), 479 states have internal predecessors, (626), 180 states have call successors, (180), 16 states have call predecessors, (180), 16 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-03 21:58:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 986 transitions. [2025-03-03 21:58:28,890 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 986 transitions. Word has length 265 [2025-03-03 21:58:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:28,890 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 986 transitions. [2025-03-03 21:58:28,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 986 transitions. [2025-03-03 21:58:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 21:58:28,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:28,893 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:28,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 21:58:28,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:28,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1267140408, now seen corresponding path program 1 times [2025-03-03 21:58:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:28,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357235779] [2025-03-03 21:58:28,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:28,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 21:58:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 21:58:28,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:28,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:31,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:31,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357235779] [2025-03-03 21:58:31,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357235779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:31,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:31,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 21:58:31,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342919077] [2025-03-03 21:58:31,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:31,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 21:58:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:31,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 21:58:31,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:58:31,813 INFO L87 Difference]: Start difference. First operand 673 states and 986 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 21:58:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:35,010 INFO L93 Difference]: Finished difference Result 1307 states and 1871 transitions. [2025-03-03 21:58:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 21:58:35,011 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 265 [2025-03-03 21:58:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:35,017 INFO L225 Difference]: With dead ends: 1307 [2025-03-03 21:58:35,017 INFO L226 Difference]: Without dead ends: 933 [2025-03-03 21:58:35,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 21:58:35,019 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 724 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 2324 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 2511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 2324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:35,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1998 Invalid, 2511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 2324 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 21:58:35,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-03 21:58:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 681. [2025-03-03 21:58:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 484 states have (on average 1.3161157024793388) internal successors, (637), 487 states have internal predecessors, (637), 180 states have call successors, (180), 16 states have call predecessors, (180), 16 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-03 21:58:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 997 transitions. [2025-03-03 21:58:35,060 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 997 transitions. Word has length 265 [2025-03-03 21:58:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:35,060 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 997 transitions. [2025-03-03 21:58:35,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 21:58:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 997 transitions. [2025-03-03 21:58:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 21:58:35,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:35,061 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:35,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 21:58:35,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:35,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash -922837961, now seen corresponding path program 1 times [2025-03-03 21:58:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:35,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186989358] [2025-03-03 21:58:35,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:35,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 21:58:35,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 21:58:35,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:35,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186989358] [2025-03-03 21:58:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186989358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:36,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:36,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 21:58:36,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442214566] [2025-03-03 21:58:36,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:36,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 21:58:36,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:36,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 21:58:36,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:58:36,733 INFO L87 Difference]: Start difference. First operand 681 states and 997 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:58:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:38,193 INFO L93 Difference]: Finished difference Result 1252 states and 1805 transitions. [2025-03-03 21:58:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 21:58:38,193 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 265 [2025-03-03 21:58:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:38,197 INFO L225 Difference]: With dead ends: 1252 [2025-03-03 21:58:38,197 INFO L226 Difference]: Without dead ends: 870 [2025-03-03 21:58:38,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:58:38,198 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 443 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:38,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1559 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 21:58:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-03 21:58:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 671. [2025-03-03 21:58:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 474 states have (on average 1.3143459915611815) internal successors, (623), 477 states have internal predecessors, (623), 180 states have call successors, (180), 16 states have call predecessors, (180), 16 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-03 21:58:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 983 transitions. [2025-03-03 21:58:38,234 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 983 transitions. Word has length 265 [2025-03-03 21:58:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:38,235 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 983 transitions. [2025-03-03 21:58:38,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2025-03-03 21:58:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 983 transitions. [2025-03-03 21:58:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 21:58:38,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:38,237 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:38,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 21:58:38,237 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:38,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -734127655, now seen corresponding path program 1 times [2025-03-03 21:58:38,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:38,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856968872] [2025-03-03 21:58:38,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:38,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 21:58:38,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 21:58:38,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:38,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:45,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:45,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856968872] [2025-03-03 21:58:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856968872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:45,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:45,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-03 21:58:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299161286] [2025-03-03 21:58:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:45,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 21:58:45,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:45,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 21:58:45,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-03-03 21:58:45,095 INFO L87 Difference]: Start difference. First operand 671 states and 983 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 21:58:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:50,797 INFO L93 Difference]: Finished difference Result 1159 states and 1661 transitions. [2025-03-03 21:58:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 21:58:50,797 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 265 [2025-03-03 21:58:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:50,801 INFO L225 Difference]: With dead ends: 1159 [2025-03-03 21:58:50,801 INFO L226 Difference]: Without dead ends: 997 [2025-03-03 21:58:50,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 21:58:50,802 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 1247 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:50,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 1894 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 21:58:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-03-03 21:58:50,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 685. [2025-03-03 21:58:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 487 states have (on average 1.3182751540041069) internal successors, (642), 490 states have internal predecessors, (642), 180 states have call successors, (180), 17 states have call predecessors, (180), 17 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-03 21:58:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1002 transitions. [2025-03-03 21:58:50,842 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1002 transitions. Word has length 265 [2025-03-03 21:58:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:50,842 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1002 transitions. [2025-03-03 21:58:50,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2025-03-03 21:58:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1002 transitions. [2025-03-03 21:58:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 21:58:50,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:50,844 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:50,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 21:58:50,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:50,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash 153376026, now seen corresponding path program 1 times [2025-03-03 21:58:50,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:50,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251518431] [2025-03-03 21:58:50,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:50,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:50,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 21:58:50,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 21:58:50,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:50,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:58:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2025-03-03 21:58:51,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:58:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251518431] [2025-03-03 21:58:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251518431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:58:51,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:58:51,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 21:58:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146854926] [2025-03-03 21:58:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:58:51,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:58:51,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:58:51,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:58:51,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:58:51,586 INFO L87 Difference]: Start difference. First operand 685 states and 1002 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:58:52,059 INFO L93 Difference]: Finished difference Result 1072 states and 1561 transitions. [2025-03-03 21:58:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 21:58:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 265 [2025-03-03 21:58:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:58:52,064 INFO L225 Difference]: With dead ends: 1072 [2025-03-03 21:58:52,064 INFO L226 Difference]: Without dead ends: 910 [2025-03-03 21:58:52,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:58:52,065 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 180 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:58:52,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1164 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:58:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-03 21:58:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 715. [2025-03-03 21:58:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 517 states have (on average 1.3288201160541586) internal successors, (687), 520 states have internal predecessors, (687), 180 states have call successors, (180), 17 states have call predecessors, (180), 17 states have return successors, (180), 177 states have call predecessors, (180), 180 states have call successors, (180) [2025-03-03 21:58:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1047 transitions. [2025-03-03 21:58:52,101 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1047 transitions. Word has length 265 [2025-03-03 21:58:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:58:52,101 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1047 transitions. [2025-03-03 21:58:52,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2025-03-03 21:58:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1047 transitions. [2025-03-03 21:58:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 21:58:52,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:58:52,103 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:58:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 21:58:52,103 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:58:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:58:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1174347767, now seen corresponding path program 1 times [2025-03-03 21:58:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:58:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202492703] [2025-03-03 21:58:52,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:58:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:58:52,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 21:58:52,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 21:58:52,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:58:52,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat