./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2913f965e0d9fa4df5794a69da1eb9ae7e20a4f8b2461420582f4690c4751bfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:02:05,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:02:05,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:02:05,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:02:05,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:02:05,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:02:05,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:02:05,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:02:05,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:02:05,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:02:05,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:02:05,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:02:05,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:02:05,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:02:05,375 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:02:05,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:02:05,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:02:05,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:02:05,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:02:05,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:02:05,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:02:05,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:02:05,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:02:05,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:02:05,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:02:05,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:02:05,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:02:05,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:02:05,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:02:05,377 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 -> 2913f965e0d9fa4df5794a69da1eb9ae7e20a4f8b2461420582f4690c4751bfe [2025-03-17 02:02:05,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:02:05,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:02:05,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:02:05,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:02:05,647 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:02:05,648 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-ci_file-81.i [2025-03-17 02:02:06,896 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4f483c/337d1f349d94459f809535f0ea88f3aa/FLAGcfaaaa8ff [2025-03-17 02:02:07,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:02:07,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i [2025-03-17 02:02:07,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4f483c/337d1f349d94459f809535f0ea88f3aa/FLAGcfaaaa8ff [2025-03-17 02:02:07,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4f483c/337d1f349d94459f809535f0ea88f3aa [2025-03-17 02:02:07,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:02:07,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:02:07,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:02:07,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:02:07,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:02:07,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1873b106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07, skipping insertion in model container [2025-03-17 02:02:07,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:02:07,616 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-ci_file-81.i[919,932] [2025-03-17 02:02:07,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:02:07,703 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:02:07,713 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-ci_file-81.i[919,932] [2025-03-17 02:02:07,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:02:07,767 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:02:07,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07 WrapperNode [2025-03-17 02:02:07,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:02:07,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:02:07,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:02:07,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:02:07,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,830 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-03-17 02:02:07,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:02:07,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:02:07,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:02:07,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:02:07,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,859 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:02:07,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:02:07,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:02:07,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:02:07,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:02:07,893 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (1/1) ... [2025-03-17 02:02:07,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:02:07,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:02:07,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:02:07,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:02:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:02:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:02:07,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:02:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:02:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:02:07,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:02:08,031 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:02:08,033 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:02:08,519 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2025-03-17 02:02:08,557 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 02:02:08,557 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:02:08,586 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:02:08,586 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:02:08,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:02:08 BoogieIcfgContainer [2025-03-17 02:02:08,587 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:02:08,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:02:08,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:02:08,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:02:08,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:02:07" (1/3) ... [2025-03-17 02:02:08,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7302c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:02:08, skipping insertion in model container [2025-03-17 02:02:08,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:02:07" (2/3) ... [2025-03-17 02:02:08,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7302c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:02:08, skipping insertion in model container [2025-03-17 02:02:08,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:02:08" (3/3) ... [2025-03-17 02:02:08,599 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i [2025-03-17 02:02:08,609 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:02:08,611 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-81.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:02:08,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:02:08,672 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;@75239ad7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:02:08,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:02:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 67 states have (on average 1.492537313432836) internal successors, (100), 68 states have internal predecessors, (100), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 02:02:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 02:02:08,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:08,701 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:08,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:08,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:08,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1821679420, now seen corresponding path program 1 times [2025-03-17 02:02:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879459877] [2025-03-17 02:02:08,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:08,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 02:02:08,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 02:02:08,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:08,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 02:02:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879459877] [2025-03-17 02:02:09,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879459877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:02:09,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011922183] [2025-03-17 02:02:09,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:09,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:02:09,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:02:09,044 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:02:09,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:02:09,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 02:02:09,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 02:02:09,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:09,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:09,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:02:09,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:02:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 02:02:09,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:02:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011922183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:09,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:02:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:02:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541416593] [2025-03-17 02:02:09,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:09,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:02:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:09,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:02:09,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:02:09,315 INFO L87 Difference]: Start difference. First operand has 101 states, 67 states have (on average 1.492537313432836) internal successors, (100), 68 states have internal predecessors, (100), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 02:02:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:09,351 INFO L93 Difference]: Finished difference Result 199 states and 353 transitions. [2025-03-17 02:02:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:02:09,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-03-17 02:02:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:09,359 INFO L225 Difference]: With dead ends: 199 [2025-03-17 02:02:09,359 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 02:02:09,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:02:09,368 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:09,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:02:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 02:02:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 02:02:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 66 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 02:02:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 158 transitions. [2025-03-17 02:02:09,413 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 158 transitions. Word has length 199 [2025-03-17 02:02:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:09,414 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 158 transitions. [2025-03-17 02:02:09,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 02:02:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2025-03-17 02:02:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 02:02:09,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:09,419 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:09,427 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-17 02:02:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:02:09,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:09,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 970671863, now seen corresponding path program 1 times [2025-03-17 02:02:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864416599] [2025-03-17 02:02:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:09,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 02:02:09,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 02:02:09,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:09,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864416599] [2025-03-17 02:02:09,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864416599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:09,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:09,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:02:09,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375547795] [2025-03-17 02:02:09,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:09,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:02:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:09,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:02:09,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:02:09,947 INFO L87 Difference]: Start difference. First operand 99 states and 158 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:10,041 INFO L93 Difference]: Finished difference Result 278 states and 448 transitions. [2025-03-17 02:02:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:02:10,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-03-17 02:02:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:10,044 INFO L225 Difference]: With dead ends: 278 [2025-03-17 02:02:10,044 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 02:02:10,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:02:10,045 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 76 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:10,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 287 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:02:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 02:02:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2025-03-17 02:02:10,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 02:02:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 262 transitions. [2025-03-17 02:02:10,084 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 262 transitions. Word has length 199 [2025-03-17 02:02:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:10,085 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 262 transitions. [2025-03-17 02:02:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 262 transitions. [2025-03-17 02:02:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-17 02:02:10,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:10,089 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:10,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:02:10,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:10,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:10,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1015490113, now seen corresponding path program 1 times [2025-03-17 02:02:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:10,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595568549] [2025-03-17 02:02:10,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:10,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:10,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 02:02:10,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 02:02:10,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:10,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:10,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595568549] [2025-03-17 02:02:10,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595568549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:10,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:10,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:02:10,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052728945] [2025-03-17 02:02:10,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:10,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:02:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:10,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:02:10,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:02:10,339 INFO L87 Difference]: Start difference. First operand 165 states and 262 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:10,423 INFO L93 Difference]: Finished difference Result 281 states and 449 transitions. [2025-03-17 02:02:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:02:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-03-17 02:02:10,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:10,426 INFO L225 Difference]: With dead ends: 281 [2025-03-17 02:02:10,428 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 02:02:10,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:02:10,429 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 74 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:10,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 429 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:02:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 02:02:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2025-03-17 02:02:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 02:02:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 261 transitions. [2025-03-17 02:02:10,462 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 261 transitions. Word has length 201 [2025-03-17 02:02:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:10,462 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 261 transitions. [2025-03-17 02:02:10,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 261 transitions. [2025-03-17 02:02:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 02:02:10,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:10,466 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:10,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:02:10,466 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:10,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 888219696, now seen corresponding path program 1 times [2025-03-17 02:02:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880337526] [2025-03-17 02:02:10,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:10,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 02:02:10,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 02:02:10,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:10,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:10,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:10,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880337526] [2025-03-17 02:02:10,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880337526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:10,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:10,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:02:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092062822] [2025-03-17 02:02:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:10,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:02:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:10,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:02:10,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:02:10,851 INFO L87 Difference]: Start difference. First operand 165 states and 261 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:11,010 INFO L93 Difference]: Finished difference Result 335 states and 529 transitions. [2025-03-17 02:02:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:02:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-17 02:02:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:11,014 INFO L225 Difference]: With dead ends: 335 [2025-03-17 02:02:11,014 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 02:02:11,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:02:11,015 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 73 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:11,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 478 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:02:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 02:02:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2025-03-17 02:02:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 154 states have (on average 1.4025974025974026) internal successors, (216), 155 states have internal predecessors, (216), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 02:02:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 348 transitions. [2025-03-17 02:02:11,054 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 348 transitions. Word has length 202 [2025-03-17 02:02:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:11,054 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 348 transitions. [2025-03-17 02:02:11,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 348 transitions. [2025-03-17 02:02:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 02:02:11,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:11,057 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:11,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:02:11,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:11,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1084733201, now seen corresponding path program 1 times [2025-03-17 02:02:11,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:11,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178214677] [2025-03-17 02:02:11,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:11,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:11,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 02:02:11,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 02:02:11,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:11,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178214677] [2025-03-17 02:02:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178214677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:11,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:11,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:02:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863176254] [2025-03-17 02:02:11,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:11,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:02:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:11,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:02:11,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:02:11,251 INFO L87 Difference]: Start difference. First operand 224 states and 348 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:11,381 INFO L93 Difference]: Finished difference Result 459 states and 706 transitions. [2025-03-17 02:02:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:02:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-17 02:02:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:11,385 INFO L225 Difference]: With dead ends: 459 [2025-03-17 02:02:11,386 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 02:02:11,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:02:11,389 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 134 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:11,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 449 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:02:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 02:02:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2025-03-17 02:02:11,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 184 states have (on average 1.434782608695652) internal successors, (264), 184 states have internal predecessors, (264), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 02:02:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 388 transitions. [2025-03-17 02:02:11,424 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 388 transitions. Word has length 202 [2025-03-17 02:02:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:11,425 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 388 transitions. [2025-03-17 02:02:11,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 388 transitions. [2025-03-17 02:02:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 02:02:11,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:11,429 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:11,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:02:11,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:11,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash -712218158, now seen corresponding path program 1 times [2025-03-17 02:02:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:11,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197377456] [2025-03-17 02:02:11,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:11,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 02:02:11,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 02:02:11,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:11,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:23,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:23,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197377456] [2025-03-17 02:02:23,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197377456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:23,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:23,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 02:02:23,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755761746] [2025-03-17 02:02:23,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:23,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 02:02:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:23,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 02:02:23,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:02:23,302 INFO L87 Difference]: Start difference. First operand 251 states and 388 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:27,863 INFO L93 Difference]: Finished difference Result 734 states and 1096 transitions. [2025-03-17 02:02:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 02:02:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-17 02:02:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:27,866 INFO L225 Difference]: With dead ends: 734 [2025-03-17 02:02:27,866 INFO L226 Difference]: Without dead ends: 573 [2025-03-17 02:02:27,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=330, Invalid=1076, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 02:02:27,868 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 802 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:27,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1002 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 02:02:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-17 02:02:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 294. [2025-03-17 02:02:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 225 states have (on average 1.431111111111111) internal successors, (322), 225 states have internal predecessors, (322), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 02:02:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 446 transitions. [2025-03-17 02:02:27,885 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 446 transitions. Word has length 202 [2025-03-17 02:02:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:27,885 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 446 transitions. [2025-03-17 02:02:27,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 446 transitions. [2025-03-17 02:02:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 02:02:27,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:27,887 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:27,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:02:27,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:27,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:27,889 INFO L85 PathProgramCache]: Analyzing trace with hash -583135439, now seen corresponding path program 1 times [2025-03-17 02:02:27,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:27,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128127379] [2025-03-17 02:02:27,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:27,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:27,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 02:02:27,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 02:02:27,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:27,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:29,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:29,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128127379] [2025-03-17 02:02:29,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128127379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:29,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:29,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:02:29,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022368786] [2025-03-17 02:02:29,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:29,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:02:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:29,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:02:29,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:02:29,228 INFO L87 Difference]: Start difference. First operand 294 states and 446 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 02:02:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:31,443 INFO L93 Difference]: Finished difference Result 729 states and 1106 transitions. [2025-03-17 02:02:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 02:02:31,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-03-17 02:02:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:31,446 INFO L225 Difference]: With dead ends: 729 [2025-03-17 02:02:31,446 INFO L226 Difference]: Without dead ends: 568 [2025-03-17 02:02:31,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2025-03-17 02:02:31,447 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 796 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:31,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 917 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 02:02:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-17 02:02:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 397. [2025-03-17 02:02:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 316 states have (on average 1.4367088607594938) internal successors, (454), 317 states have internal predecessors, (454), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:02:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 598 transitions. [2025-03-17 02:02:31,476 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 598 transitions. Word has length 202 [2025-03-17 02:02:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:31,477 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 598 transitions. [2025-03-17 02:02:31,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 02:02:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 598 transitions. [2025-03-17 02:02:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-17 02:02:31,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:31,479 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:31,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:02:31,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:31,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:31,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1217776783, now seen corresponding path program 1 times [2025-03-17 02:02:31,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976147427] [2025-03-17 02:02:31,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:31,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-17 02:02:31,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-17 02:02:31,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:31,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:32,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:32,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976147427] [2025-03-17 02:02:32,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976147427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:32,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:32,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:02:32,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679193400] [2025-03-17 02:02:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:32,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:02:32,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:32,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:02:32,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:02:32,088 INFO L87 Difference]: Start difference. First operand 397 states and 598 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:32,796 INFO L93 Difference]: Finished difference Result 790 states and 1191 transitions. [2025-03-17 02:02:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 02:02:32,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-17 02:02:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:32,800 INFO L225 Difference]: With dead ends: 790 [2025-03-17 02:02:32,800 INFO L226 Difference]: Without dead ends: 592 [2025-03-17 02:02:32,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2025-03-17 02:02:32,801 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 514 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:32,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 785 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:02:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-17 02:02:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 402. [2025-03-17 02:02:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 321 states have (on average 1.439252336448598) internal successors, (462), 322 states have internal predecessors, (462), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:02:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 606 transitions. [2025-03-17 02:02:32,825 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 606 transitions. Word has length 202 [2025-03-17 02:02:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:32,825 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 606 transitions. [2025-03-17 02:02:32,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 606 transitions. [2025-03-17 02:02:32,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 02:02:32,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:32,828 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:32,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:02:32,829 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:32,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash -13628063, now seen corresponding path program 1 times [2025-03-17 02:02:32,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:32,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925731572] [2025-03-17 02:02:32,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:32,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:32,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 02:02:32,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 02:02:32,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:32,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:38,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925731572] [2025-03-17 02:02:38,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925731572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:38,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:38,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:02:38,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649247484] [2025-03-17 02:02:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:38,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:02:38,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:38,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:02:38,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:02:38,724 INFO L87 Difference]: Start difference. First operand 402 states and 606 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:41,142 INFO L93 Difference]: Finished difference Result 796 states and 1188 transitions. [2025-03-17 02:02:41,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:02:41,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 02:02:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:41,145 INFO L225 Difference]: With dead ends: 796 [2025-03-17 02:02:41,145 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 02:02:41,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-03-17 02:02:41,150 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 446 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:41,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 768 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 02:02:41,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 02:02:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 443. [2025-03-17 02:02:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 362 states have (on average 1.4475138121546962) internal successors, (524), 363 states have internal predecessors, (524), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:02:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 668 transitions. [2025-03-17 02:02:41,179 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 668 transitions. Word has length 203 [2025-03-17 02:02:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:41,179 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 668 transitions. [2025-03-17 02:02:41,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 668 transitions. [2025-03-17 02:02:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 02:02:41,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:41,182 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:41,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:02:41,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:41,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash 115454656, now seen corresponding path program 1 times [2025-03-17 02:02:41,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:41,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658287838] [2025-03-17 02:02:41,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:41,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:41,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 02:02:41,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 02:02:41,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:41,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:41,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:41,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658287838] [2025-03-17 02:02:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658287838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:41,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:02:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156018327] [2025-03-17 02:02:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:41,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:02:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:41,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:02:41,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:02:41,594 INFO L87 Difference]: Start difference. First operand 443 states and 668 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:41,949 INFO L93 Difference]: Finished difference Result 728 states and 1104 transitions. [2025-03-17 02:02:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:02:41,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 02:02:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:41,951 INFO L225 Difference]: With dead ends: 728 [2025-03-17 02:02:41,952 INFO L226 Difference]: Without dead ends: 498 [2025-03-17 02:02:41,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:02:41,953 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 185 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:41,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 574 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:02:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-17 02:02:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 460. [2025-03-17 02:02:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 379 states have (on average 1.4195250659630607) internal successors, (538), 380 states have internal predecessors, (538), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:02:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 682 transitions. [2025-03-17 02:02:41,976 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 682 transitions. Word has length 203 [2025-03-17 02:02:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:41,976 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 682 transitions. [2025-03-17 02:02:41,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 682 transitions. [2025-03-17 02:02:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 02:02:41,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:41,978 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:02:41,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:41,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -519186688, now seen corresponding path program 1 times [2025-03-17 02:02:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236836543] [2025-03-17 02:02:41,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:41,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 02:02:42,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 02:02:42,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:42,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236836543] [2025-03-17 02:02:49,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236836543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:49,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:49,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:02:49,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141563503] [2025-03-17 02:02:49,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:49,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:02:49,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:49,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:02:49,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:02:49,253 INFO L87 Difference]: Start difference. First operand 460 states and 682 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:50,464 INFO L93 Difference]: Finished difference Result 724 states and 1074 transitions. [2025-03-17 02:02:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:02:50,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 02:02:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:50,467 INFO L225 Difference]: With dead ends: 724 [2025-03-17 02:02:50,467 INFO L226 Difference]: Without dead ends: 536 [2025-03-17 02:02:50,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:02:50,468 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 136 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:50,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 452 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:02:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-17 02:02:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 472. [2025-03-17 02:02:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 391 states have (on average 1.4194373401534526) internal successors, (555), 392 states have internal predecessors, (555), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:02:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 699 transitions. [2025-03-17 02:02:50,494 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 699 transitions. Word has length 203 [2025-03-17 02:02:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:50,494 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 699 transitions. [2025-03-17 02:02:50,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 699 transitions. [2025-03-17 02:02:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 02:02:50,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:50,496 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:50,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:02:50,496 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:50,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1217067462, now seen corresponding path program 1 times [2025-03-17 02:02:50,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:50,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340191380] [2025-03-17 02:02:50,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:50,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 02:02:50,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 02:02:50,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:50,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:02:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:02:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:02:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340191380] [2025-03-17 02:02:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340191380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:02:55,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:02:55,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 02:02:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598815967] [2025-03-17 02:02:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:02:55,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 02:02:55,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:02:55,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 02:02:55,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:02:55,535 INFO L87 Difference]: Start difference. First operand 472 states and 699 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:02:58,983 INFO L93 Difference]: Finished difference Result 1078 states and 1533 transitions. [2025-03-17 02:02:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 02:02:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 02:02:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:02:58,987 INFO L225 Difference]: With dead ends: 1078 [2025-03-17 02:02:58,987 INFO L226 Difference]: Without dead ends: 870 [2025-03-17 02:02:58,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=361, Invalid=1199, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 02:02:58,988 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1013 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:02:58,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 931 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 02:02:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-17 02:02:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 486. [2025-03-17 02:02:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 405 states have (on average 1.4148148148148147) internal successors, (573), 406 states have internal predecessors, (573), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:02:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 717 transitions. [2025-03-17 02:02:59,013 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 717 transitions. Word has length 203 [2025-03-17 02:02:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:02:59,014 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 717 transitions. [2025-03-17 02:02:59,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:02:59,014 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 717 transitions. [2025-03-17 02:02:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 02:02:59,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:02:59,016 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:02:59,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:02:59,016 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:02:59,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:02:59,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1280948475, now seen corresponding path program 1 times [2025-03-17 02:02:59,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:02:59,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997705211] [2025-03-17 02:02:59,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:02:59,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:02:59,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 02:02:59,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 02:02:59,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:02:59,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:03:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997705211] [2025-03-17 02:03:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997705211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:03,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:03,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 02:03:03,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512195793] [2025-03-17 02:03:03,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:03,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 02:03:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:03,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 02:03:03,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:03:03,316 INFO L87 Difference]: Start difference. First operand 486 states and 717 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:03:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:06,437 INFO L93 Difference]: Finished difference Result 879 states and 1278 transitions. [2025-03-17 02:03:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 02:03:06,437 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 02:03:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:06,441 INFO L225 Difference]: With dead ends: 879 [2025-03-17 02:03:06,441 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 02:03:06,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=311, Invalid=1171, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 02:03:06,442 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 660 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:06,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1012 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 02:03:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 02:03:06,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 492. [2025-03-17 02:03:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 411 states have (on average 1.416058394160584) internal successors, (582), 412 states have internal predecessors, (582), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:03:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 726 transitions. [2025-03-17 02:03:06,468 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 726 transitions. Word has length 203 [2025-03-17 02:03:06,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:06,468 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 726 transitions. [2025-03-17 02:03:06,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:03:06,468 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 726 transitions. [2025-03-17 02:03:06,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 02:03:06,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:06,469 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:06,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 02:03:06,469 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:06,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:06,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1477461980, now seen corresponding path program 1 times [2025-03-17 02:03:06,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:06,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046652743] [2025-03-17 02:03:06,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:06,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:06,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 02:03:06,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 02:03:06,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:06,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:03:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046652743] [2025-03-17 02:03:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046652743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:12,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:12,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 02:03:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137531644] [2025-03-17 02:03:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:12,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 02:03:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:12,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 02:03:12,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:03:12,075 INFO L87 Difference]: Start difference. First operand 492 states and 726 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:03:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:14,453 INFO L93 Difference]: Finished difference Result 869 states and 1270 transitions. [2025-03-17 02:03:14,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 02:03:14,454 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 02:03:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:14,456 INFO L225 Difference]: With dead ends: 869 [2025-03-17 02:03:14,456 INFO L226 Difference]: Without dead ends: 691 [2025-03-17 02:03:14,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-17 02:03:14,457 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 668 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:14,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 937 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 02:03:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-17 02:03:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 498. [2025-03-17 02:03:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 417 states have (on average 1.4148681055155876) internal successors, (590), 418 states have internal predecessors, (590), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:03:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 734 transitions. [2025-03-17 02:03:14,481 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 734 transitions. Word has length 203 [2025-03-17 02:03:14,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:14,481 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 734 transitions. [2025-03-17 02:03:14,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:03:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 734 transitions. [2025-03-17 02:03:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 02:03:14,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:14,483 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:14,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 02:03:14,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:14,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash 290484347, now seen corresponding path program 1 times [2025-03-17 02:03:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:14,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677523745] [2025-03-17 02:03:14,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:14,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 02:03:14,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 02:03:14,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:14,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:03:19,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:19,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677523745] [2025-03-17 02:03:19,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677523745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:19,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:19,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 02:03:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739417241] [2025-03-17 02:03:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 02:03:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:19,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 02:03:19,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:03:19,499 INFO L87 Difference]: Start difference. First operand 498 states and 734 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:03:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:03:22,430 INFO L93 Difference]: Finished difference Result 986 states and 1416 transitions. [2025-03-17 02:03:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 02:03:22,431 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-17 02:03:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:03:22,433 INFO L225 Difference]: With dead ends: 986 [2025-03-17 02:03:22,434 INFO L226 Difference]: Without dead ends: 808 [2025-03-17 02:03:22,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-17 02:03:22,438 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 664 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:03:22,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 840 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 02:03:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-03-17 02:03:22,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 498. [2025-03-17 02:03:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 417 states have (on average 1.4148681055155876) internal successors, (590), 418 states have internal predecessors, (590), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 02:03:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 734 transitions. [2025-03-17 02:03:22,467 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 734 transitions. Word has length 203 [2025-03-17 02:03:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:03:22,467 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 734 transitions. [2025-03-17 02:03:22,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 02:03:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 734 transitions. [2025-03-17 02:03:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-17 02:03:22,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:03:22,468 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:03:22,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 02:03:22,469 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:03:22,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:03:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1506467012, now seen corresponding path program 1 times [2025-03-17 02:03:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:03:22,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849193254] [2025-03-17 02:03:22,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:03:22,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:03:22,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 02:03:22,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 02:03:22,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:03:22,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:03:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 02:03:30,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:03:31,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849193254] [2025-03-17 02:03:31,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849193254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:03:31,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:03:31,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 02:03:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163262400] [2025-03-17 02:03:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:03:31,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 02:03:31,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:03:31,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 02:03:31,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 02:03:31,003 INFO L87 Difference]: Start difference. First operand 498 states and 734 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31)