./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-62.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 4f8957d243f60f3b1c8dd5ae8036bb47a7344420b54bde3f58916ec11256e152 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:46:01,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:46:02,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:46:02,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:46:02,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:46:02,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:46:02,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:46:02,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:46:02,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:46:02,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:46:02,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:46:02,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:46:02,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:46:02,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:46:02,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:46:02,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:46:02,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:46:02,043 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 -> 4f8957d243f60f3b1c8dd5ae8036bb47a7344420b54bde3f58916ec11256e152 [2025-03-08 15:46:02,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:46:02,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:46:02,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:46:02,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:46:02,293 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:46:02,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-62.i [2025-03-08 15:46:03,488 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ada5b09/ce18077f737640bcb41c4e441be3f94f/FLAG9e61aa738 [2025-03-08 15:46:03,787 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:46:03,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-62.i [2025-03-08 15:46:03,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ada5b09/ce18077f737640bcb41c4e441be3f94f/FLAG9e61aa738 [2025-03-08 15:46:04,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ada5b09/ce18077f737640bcb41c4e441be3f94f [2025-03-08 15:46:04,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:46:04,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:46:04,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:46:04,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:46:04,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:46:04,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df6ce79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04, skipping insertion in model container [2025-03-08 15:46:04,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:46:04,205 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_operatoramount_amount500_file-62.i[916,929] [2025-03-08 15:46:04,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:46:04,361 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:46:04,368 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_operatoramount_amount500_file-62.i[916,929] [2025-03-08 15:46:04,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:46:04,473 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:46:04,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04 WrapperNode [2025-03-08 15:46:04,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:46:04,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:46:04,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:46:04,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:46:04,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,592 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 875 [2025-03-08 15:46:04,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:46:04,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:46:04,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:46:04,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:46:04,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,704 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:46:04,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:46:04,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:46:04,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:46:04,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:46:04,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (1/1) ... [2025-03-08 15:46:04,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:46:04,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:04,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:46:04,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:46:04,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:46:04,820 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:46:04,820 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:46:04,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:46:04,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:46:04,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:46:04,954 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:46:04,956 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:46:05,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L686: havoc property_#t~ite63#1;havoc property_#t~bitwise62#1;havoc property_#t~short64#1;havoc property_#t~ite67#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short68#1;havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short71#1;havoc property_#t~ite73#1;havoc property_#t~bitwise72#1;havoc property_#t~short74#1;havoc property_#t~ite78#1;havoc property_#t~ite77#1;havoc property_#t~ite76#1;havoc property_#t~bitwise75#1;havoc property_#t~short79#1;havoc property_#t~bitwise80#1;havoc property_#t~ite83#1;havoc property_#t~bitwise81#1;havoc property_#t~short82#1;havoc property_#t~short84#1; [2025-03-08 15:46:06,070 INFO L? ?]: Removed 101 outVars from TransFormulas that were not future-live. [2025-03-08 15:46:06,070 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:46:06,101 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:46:06,104 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:46:06,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:46:06 BoogieIcfgContainer [2025-03-08 15:46:06,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:46:06,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:46:06,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:46:06,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:46:06,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:46:04" (1/3) ... [2025-03-08 15:46:06,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69730252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:46:06, skipping insertion in model container [2025-03-08 15:46:06,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:46:04" (2/3) ... [2025-03-08 15:46:06,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69730252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:46:06, skipping insertion in model container [2025-03-08 15:46:06,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:46:06" (3/3) ... [2025-03-08 15:46:06,111 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-62.i [2025-03-08 15:46:06,121 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:46:06,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-62.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:46:06,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:46:06,191 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;@7c172c55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:46:06,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:46:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 257 states have (on average 1.5291828793774318) internal successors, (393), 258 states have internal predecessors, (393), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:46:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:46:06,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:06,223 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:06,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:06,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash -667756142, now seen corresponding path program 1 times [2025-03-08 15:46:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:06,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529331308] [2025-03-08 15:46:06,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:06,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:06,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:06,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:06,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-08 15:46:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529331308] [2025-03-08 15:46:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529331308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:06,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677900122] [2025-03-08 15:46:06,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:06,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:06,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:06,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:46:06,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:46:07,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:07,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:07,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:07,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:07,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:46:07,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-08 15:46:07,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:46:07,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677900122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:07,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:46:07,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:46:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783074182] [2025-03-08 15:46:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:07,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:46:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:07,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:46:07,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:46:07,357 INFO L87 Difference]: Start difference. First operand has 346 states, 257 states have (on average 1.5291828793774318) internal successors, (393), 258 states have internal predecessors, (393), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:46:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:07,440 INFO L93 Difference]: Finished difference Result 686 states and 1211 transitions. [2025-03-08 15:46:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:46:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 575 [2025-03-08 15:46:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:07,451 INFO L225 Difference]: With dead ends: 686 [2025-03-08 15:46:07,451 INFO L226 Difference]: Without dead ends: 343 [2025-03-08 15:46:07,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:46:07,462 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:07,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:46:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-08 15:46:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-03-08 15:46:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 255 states have (on average 1.5215686274509803) internal successors, (388), 255 states have internal predecessors, (388), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:46:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 560 transitions. [2025-03-08 15:46:07,542 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 560 transitions. Word has length 575 [2025-03-08 15:46:07,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:07,544 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 560 transitions. [2025-03-08 15:46:07,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:46:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 560 transitions. [2025-03-08 15:46:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:46:07,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:07,558 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:07,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:46:07,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:46:07,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:07,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1344665254, now seen corresponding path program 1 times [2025-03-08 15:46:07,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:07,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132401683] [2025-03-08 15:46:07,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:07,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:07,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:07,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:07,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:08,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:08,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132401683] [2025-03-08 15:46:08,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132401683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:08,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:08,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754221242] [2025-03-08 15:46:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:08,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:08,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:08,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:08,260 INFO L87 Difference]: Start difference. First operand 343 states and 560 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:08,355 INFO L93 Difference]: Finished difference Result 843 states and 1380 transitions. [2025-03-08 15:46:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 575 [2025-03-08 15:46:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:08,363 INFO L225 Difference]: With dead ends: 843 [2025-03-08 15:46:08,364 INFO L226 Difference]: Without dead ends: 503 [2025-03-08 15:46:08,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:08,367 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 275 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:08,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1307 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-08 15:46:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 482. [2025-03-08 15:46:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 394 states have (on average 1.5761421319796953) internal successors, (621), 394 states have internal predecessors, (621), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:46:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 793 transitions. [2025-03-08 15:46:08,415 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 793 transitions. Word has length 575 [2025-03-08 15:46:08,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:08,418 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 793 transitions. [2025-03-08 15:46:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 793 transitions. [2025-03-08 15:46:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:46:08,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:08,426 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:08,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:46:08,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:08,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:08,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1464785127, now seen corresponding path program 1 times [2025-03-08 15:46:08,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:08,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439998698] [2025-03-08 15:46:08,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:08,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:08,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:08,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:08,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:08,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:08,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439998698] [2025-03-08 15:46:08,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439998698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:08,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:08,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:08,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884758287] [2025-03-08 15:46:08,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:08,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:08,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:08,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:08,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:08,864 INFO L87 Difference]: Start difference. First operand 482 states and 793 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:09,024 INFO L93 Difference]: Finished difference Result 1325 states and 2181 transitions. [2025-03-08 15:46:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:09,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 575 [2025-03-08 15:46:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:09,031 INFO L225 Difference]: With dead ends: 1325 [2025-03-08 15:46:09,031 INFO L226 Difference]: Without dead ends: 846 [2025-03-08 15:46:09,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:09,033 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 350 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:09,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1128 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-08 15:46:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 843. [2025-03-08 15:46:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 726 states have (on average 1.5826446280991735) internal successors, (1149), 727 states have internal predecessors, (1149), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-08 15:46:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1377 transitions. [2025-03-08 15:46:09,090 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1377 transitions. Word has length 575 [2025-03-08 15:46:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:09,092 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1377 transitions. [2025-03-08 15:46:09,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1377 transitions. [2025-03-08 15:46:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:46:09,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:09,103 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:09,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:46:09,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:09,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2021285797, now seen corresponding path program 1 times [2025-03-08 15:46:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915817874] [2025-03-08 15:46:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:09,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:09,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:09,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:09,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:09,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:09,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915817874] [2025-03-08 15:46:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915817874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:09,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110050593] [2025-03-08 15:46:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:09,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:09,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:09,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:09,438 INFO L87 Difference]: Start difference. First operand 843 states and 1377 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:09,568 INFO L93 Difference]: Finished difference Result 2467 states and 4033 transitions. [2025-03-08 15:46:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 575 [2025-03-08 15:46:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:09,581 INFO L225 Difference]: With dead ends: 2467 [2025-03-08 15:46:09,582 INFO L226 Difference]: Without dead ends: 1627 [2025-03-08 15:46:09,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:09,587 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 531 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:09,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1073 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:09,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2025-03-08 15:46:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 855. [2025-03-08 15:46:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 738 states have (on average 1.575880758807588) internal successors, (1163), 739 states have internal predecessors, (1163), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-08 15:46:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1391 transitions. [2025-03-08 15:46:09,667 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1391 transitions. Word has length 575 [2025-03-08 15:46:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:09,668 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1391 transitions. [2025-03-08 15:46:09,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1391 transitions. [2025-03-08 15:46:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:46:09,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:09,676 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:09,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:46:09,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:09,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1643222874, now seen corresponding path program 1 times [2025-03-08 15:46:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:09,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029820023] [2025-03-08 15:46:09,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:09,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:09,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:09,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:09,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029820023] [2025-03-08 15:46:09,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029820023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:09,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:09,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066166908] [2025-03-08 15:46:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:09,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:09,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:09,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:09,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:09,949 INFO L87 Difference]: Start difference. First operand 855 states and 1391 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:46:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:10,035 INFO L93 Difference]: Finished difference Result 1707 states and 2779 transitions. [2025-03-08 15:46:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 575 [2025-03-08 15:46:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:10,042 INFO L225 Difference]: With dead ends: 1707 [2025-03-08 15:46:10,043 INFO L226 Difference]: Without dead ends: 855 [2025-03-08 15:46: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-08 15:46:10,045 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 455 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:10,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 527 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-08 15:46:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2025-03-08 15:46:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 738 states have (on average 1.570460704607046) internal successors, (1159), 739 states have internal predecessors, (1159), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 113 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-08 15:46:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1387 transitions. [2025-03-08 15:46:10,080 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1387 transitions. Word has length 575 [2025-03-08 15:46:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:10,083 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1387 transitions. [2025-03-08 15:46:10,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:46:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1387 transitions. [2025-03-08 15:46:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:46:10,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:10,088 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:10,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:46:10,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2091919513, now seen corresponding path program 1 times [2025-03-08 15:46:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:10,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166156513] [2025-03-08 15:46:10,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:10,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:10,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:10,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:10,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166156513] [2025-03-08 15:46:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166156513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:10,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:10,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479710681] [2025-03-08 15:46:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:10,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:10,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:10,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:10,324 INFO L87 Difference]: Start difference. First operand 855 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:10,439 INFO L93 Difference]: Finished difference Result 2551 states and 4139 transitions. [2025-03-08 15:46:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:10,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 575 [2025-03-08 15:46:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:10,450 INFO L225 Difference]: With dead ends: 2551 [2025-03-08 15:46:10,450 INFO L226 Difference]: Without dead ends: 1699 [2025-03-08 15:46:10,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:10,454 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 547 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:10,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1224 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-03-08 15:46:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1697. [2025-03-08 15:46:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1464 states have (on average 1.5614754098360655) internal successors, (2286), 1466 states have internal predecessors, (2286), 228 states have call successors, (228), 4 states have call predecessors, (228), 4 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-08 15:46:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2742 transitions. [2025-03-08 15:46:10,534 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2742 transitions. Word has length 575 [2025-03-08 15:46:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:10,535 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2742 transitions. [2025-03-08 15:46:10,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2742 transitions. [2025-03-08 15:46:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:46:10,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:10,541 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:10,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:46:10,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1280364200, now seen corresponding path program 1 times [2025-03-08 15:46:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:10,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889102510] [2025-03-08 15:46:10,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:10,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:10,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:10,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:12,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889102510] [2025-03-08 15:46:12,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889102510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:12,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:12,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:46:12,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575618824] [2025-03-08 15:46:12,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:12,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:46:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:12,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:46:12,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:46:12,734 INFO L87 Difference]: Start difference. First operand 1697 states and 2742 transitions. Second operand has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:46:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:14,731 INFO L93 Difference]: Finished difference Result 6417 states and 10346 transitions. [2025-03-08 15:46:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:46:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 575 [2025-03-08 15:46:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:14,751 INFO L225 Difference]: With dead ends: 6417 [2025-03-08 15:46:14,752 INFO L226 Difference]: Without dead ends: 4723 [2025-03-08 15:46:14,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:46:14,758 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 2417 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:14,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 2212 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 15:46:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2025-03-08 15:46:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 2469. [2025-03-08 15:46:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2234 states have (on average 1.5917636526410026) internal successors, (3556), 2236 states have internal predecessors, (3556), 228 states have call successors, (228), 6 states have call predecessors, (228), 6 states have return successors, (228), 226 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-08 15:46:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 4012 transitions. [2025-03-08 15:46:14,876 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 4012 transitions. Word has length 575 [2025-03-08 15:46:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:14,878 INFO L471 AbstractCegarLoop]: Abstraction has 2469 states and 4012 transitions. [2025-03-08 15:46:14,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.5) internal successors, (148), 8 states have internal predecessors, (148), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:46:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 4012 transitions. [2025-03-08 15:46:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 15:46:14,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:14,885 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:14,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:46:14,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash -757692089, now seen corresponding path program 1 times [2025-03-08 15:46:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926376703] [2025-03-08 15:46:14,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:14,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 15:46:14,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 15:46:14,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:14,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:15,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:15,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926376703] [2025-03-08 15:46:15,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926376703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:15,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:15,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:46:15,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419753737] [2025-03-08 15:46:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:15,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:46:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:15,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:46:15,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:46:15,303 INFO L87 Difference]: Start difference. First operand 2469 states and 4012 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:15,727 INFO L93 Difference]: Finished difference Result 7235 states and 11739 transitions. [2025-03-08 15:46:15,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:46:15,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 575 [2025-03-08 15:46:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:15,745 INFO L225 Difference]: With dead ends: 7235 [2025-03-08 15:46:15,746 INFO L226 Difference]: Without dead ends: 4769 [2025-03-08 15:46:15,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:46:15,751 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 695 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:15,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 2480 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:46:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2025-03-08 15:46:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4521. [2025-03-08 15:46:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4521 states, 4169 states have (on average 1.59846485967858) internal successors, (6664), 4172 states have internal predecessors, (6664), 342 states have call successors, (342), 9 states have call predecessors, (342), 9 states have return successors, (342), 339 states have call predecessors, (342), 342 states have call successors, (342) [2025-03-08 15:46:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4521 states to 4521 states and 7348 transitions. [2025-03-08 15:46:15,906 INFO L78 Accepts]: Start accepts. Automaton has 4521 states and 7348 transitions. Word has length 575 [2025-03-08 15:46:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:15,907 INFO L471 AbstractCegarLoop]: Abstraction has 4521 states and 7348 transitions. [2025-03-08 15:46:15,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4521 states and 7348 transitions. [2025-03-08 15:46:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 15:46:15,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:15,913 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:15,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:46:15,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:15,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:15,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1965315505, now seen corresponding path program 1 times [2025-03-08 15:46:15,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:15,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768647391] [2025-03-08 15:46:15,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:15,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 15:46:15,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 15:46:15,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:15,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768647391] [2025-03-08 15:46:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768647391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:16,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698940996] [2025-03-08 15:46:16,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:16,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:16,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:16,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:16,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:16,327 INFO L87 Difference]: Start difference. First operand 4521 states and 7348 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:16,754 INFO L93 Difference]: Finished difference Result 11287 states and 18313 transitions. [2025-03-08 15:46:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 576 [2025-03-08 15:46:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:16,778 INFO L225 Difference]: With dead ends: 11287 [2025-03-08 15:46:16,779 INFO L226 Difference]: Without dead ends: 6769 [2025-03-08 15:46:16,788 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-08 15:46:16,788 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 456 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:16,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1595 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:46:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2025-03-08 15:46:16,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 6413. [2025-03-08 15:46:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6413 states, 5973 states have (on average 1.6037167252636866) internal successors, (9579), 5976 states have internal predecessors, (9579), 428 states have call successors, (428), 11 states have call predecessors, (428), 11 states have return successors, (428), 425 states have call predecessors, (428), 428 states have call successors, (428) [2025-03-08 15:46:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 10435 transitions. [2025-03-08 15:46:16,980 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 10435 transitions. Word has length 576 [2025-03-08 15:46:16,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:16,981 INFO L471 AbstractCegarLoop]: Abstraction has 6413 states and 10435 transitions. [2025-03-08 15:46:16,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 10435 transitions. [2025-03-08 15:46:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 15:46:16,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:16,987 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:16,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:46:16,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:16,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1445976284, now seen corresponding path program 1 times [2025-03-08 15:46:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136889642] [2025-03-08 15:46:16,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:17,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 15:46:17,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 15:46:17,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:17,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:17,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136889642] [2025-03-08 15:46:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136889642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:17,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:17,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:17,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601207391] [2025-03-08 15:46:17,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:17,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:17,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:17,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:17,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:17,573 INFO L87 Difference]: Start difference. First operand 6413 states and 10435 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:17,769 INFO L93 Difference]: Finished difference Result 17910 states and 29150 transitions. [2025-03-08 15:46:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 577 [2025-03-08 15:46:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:17,812 INFO L225 Difference]: With dead ends: 17910 [2025-03-08 15:46:17,812 INFO L226 Difference]: Without dead ends: 11754 [2025-03-08 15:46:17,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:17,827 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 394 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:17,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1183 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11754 states. [2025-03-08 15:46:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11754 to 11752. [2025-03-08 15:46:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11752 states, 10961 states have (on average 1.5868990055651857) internal successors, (17394), 10967 states have internal predecessors, (17394), 770 states have call successors, (770), 20 states have call predecessors, (770), 20 states have return successors, (770), 764 states have call predecessors, (770), 770 states have call successors, (770) [2025-03-08 15:46:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 18934 transitions. [2025-03-08 15:46:18,157 INFO L78 Accepts]: Start accepts. Automaton has 11752 states and 18934 transitions. Word has length 577 [2025-03-08 15:46:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:18,158 INFO L471 AbstractCegarLoop]: Abstraction has 11752 states and 18934 transitions. [2025-03-08 15:46:18,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 11752 states and 18934 transitions. [2025-03-08 15:46:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-08 15:46:18,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:18,167 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:18,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:46:18,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:18,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash 28696009, now seen corresponding path program 1 times [2025-03-08 15:46:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267281697] [2025-03-08 15:46:18,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:18,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-08 15:46:18,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-08 15:46:18,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:18,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:18,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267281697] [2025-03-08 15:46:18,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267281697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:18,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:18,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287869832] [2025-03-08 15:46:18,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:18,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:18,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:18,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:18,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:18,868 INFO L87 Difference]: Start difference. First operand 11752 states and 18934 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:19,320 INFO L93 Difference]: Finished difference Result 29254 states and 47090 transitions. [2025-03-08 15:46:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:19,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 578 [2025-03-08 15:46:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:19,366 INFO L225 Difference]: With dead ends: 29254 [2025-03-08 15:46:19,367 INFO L226 Difference]: Without dead ends: 17985 [2025-03-08 15:46:19,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:19,390 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 596 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:19,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 1284 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:46:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17985 states. [2025-03-08 15:46:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17985 to 14754. [2025-03-08 15:46:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14754 states, 13950 states have (on average 1.5876702508960574) internal successors, (22148), 13956 states have internal predecessors, (22148), 770 states have call successors, (770), 33 states have call predecessors, (770), 33 states have return successors, (770), 764 states have call predecessors, (770), 770 states have call successors, (770) [2025-03-08 15:46:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14754 states to 14754 states and 23688 transitions. [2025-03-08 15:46:19,805 INFO L78 Accepts]: Start accepts. Automaton has 14754 states and 23688 transitions. Word has length 578 [2025-03-08 15:46:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:19,806 INFO L471 AbstractCegarLoop]: Abstraction has 14754 states and 23688 transitions. [2025-03-08 15:46:19,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 14754 states and 23688 transitions. [2025-03-08 15:46:19,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-08 15:46:19,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:19,819 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:19,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:46:19,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:19,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash -702674583, now seen corresponding path program 1 times [2025-03-08 15:46:19,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:19,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356653516] [2025-03-08 15:46:19,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:19,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:19,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-08 15:46:20,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-08 15:46:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:20,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:20,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356653516] [2025-03-08 15:46:20,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356653516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:20,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:20,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:20,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927158410] [2025-03-08 15:46:20,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:20,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:20,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:20,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:20,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:20,834 INFO L87 Difference]: Start difference. First operand 14754 states and 23688 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:21,539 INFO L93 Difference]: Finished difference Result 35896 states and 57711 transitions. [2025-03-08 15:46:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:21,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 578 [2025-03-08 15:46:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:21,605 INFO L225 Difference]: With dead ends: 35896 [2025-03-08 15:46:21,605 INFO L226 Difference]: Without dead ends: 26544 [2025-03-08 15:46:21,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:21,628 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 781 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:21,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2123 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:46:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2025-03-08 15:46:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 24786. [2025-03-08 15:46:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24786 states, 23352 states have (on average 1.5870161014045907) internal successors, (37060), 23370 states have internal predecessors, (37060), 1370 states have call successors, (1370), 63 states have call predecessors, (1370), 63 states have return successors, (1370), 1352 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-03-08 15:46:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24786 states to 24786 states and 39800 transitions. [2025-03-08 15:46:22,201 INFO L78 Accepts]: Start accepts. Automaton has 24786 states and 39800 transitions. Word has length 578 [2025-03-08 15:46:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:22,202 INFO L471 AbstractCegarLoop]: Abstraction has 24786 states and 39800 transitions. [2025-03-08 15:46:22,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 24786 states and 39800 transitions. [2025-03-08 15:46:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-08 15:46:22,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:22,215 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:22,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:46:22,216 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:22,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:22,216 INFO L85 PathProgramCache]: Analyzing trace with hash -682337208, now seen corresponding path program 1 times [2025-03-08 15:46:22,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:22,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718549398] [2025-03-08 15:46:22,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:22,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-08 15:46:22,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-08 15:46:22,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:22,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718549398] [2025-03-08 15:46:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718549398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941575896] [2025-03-08 15:46:23,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:23,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:23,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:23,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:23,033 INFO L87 Difference]: Start difference. First operand 24786 states and 39800 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:23,613 INFO L93 Difference]: Finished difference Result 44286 states and 71060 transitions. [2025-03-08 15:46:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 578 [2025-03-08 15:46:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:23,661 INFO L225 Difference]: With dead ends: 44286 [2025-03-08 15:46:23,661 INFO L226 Difference]: Without dead ends: 21536 [2025-03-08 15:46:23,692 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-08 15:46:23,693 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 400 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:23,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1614 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:46:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21536 states. [2025-03-08 15:46:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21536 to 21344. [2025-03-08 15:46:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21344 states, 19910 states have (on average 1.5807132094424912) internal successors, (31472), 19928 states have internal predecessors, (31472), 1370 states have call successors, (1370), 63 states have call predecessors, (1370), 63 states have return successors, (1370), 1352 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-03-08 15:46:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21344 states to 21344 states and 34212 transitions. [2025-03-08 15:46:24,435 INFO L78 Accepts]: Start accepts. Automaton has 21344 states and 34212 transitions. Word has length 578 [2025-03-08 15:46:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:24,436 INFO L471 AbstractCegarLoop]: Abstraction has 21344 states and 34212 transitions. [2025-03-08 15:46:24,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 21344 states and 34212 transitions. [2025-03-08 15:46:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-08 15:46:24,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:24,445 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:24,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:46:24,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:24,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:24,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1974777128, now seen corresponding path program 1 times [2025-03-08 15:46:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:24,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758302220] [2025-03-08 15:46:24,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:24,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-08 15:46:24,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-08 15:46:24,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:24,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:24,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:24,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758302220] [2025-03-08 15:46:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758302220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:24,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658073621] [2025-03-08 15:46:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:24,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:24,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:24,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:24,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:24,675 INFO L87 Difference]: Start difference. First operand 21344 states and 34212 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:25,332 INFO L93 Difference]: Finished difference Result 54994 states and 87704 transitions. [2025-03-08 15:46:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 578 [2025-03-08 15:46:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:25,397 INFO L225 Difference]: With dead ends: 54994 [2025-03-08 15:46:25,397 INFO L226 Difference]: Without dead ends: 35341 [2025-03-08 15:46:25,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:25,415 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 246 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:25,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1250 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35341 states. [2025-03-08 15:46:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35341 to 35315. [2025-03-08 15:46:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35315 states, 33209 states have (on average 1.5663826071245746) internal successors, (52018), 33251 states have internal predecessors, (52018), 1994 states have call successors, (1994), 111 states have call predecessors, (1994), 111 states have return successors, (1994), 1952 states have call predecessors, (1994), 1994 states have call successors, (1994) [2025-03-08 15:46:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35315 states to 35315 states and 56006 transitions. [2025-03-08 15:46:26,175 INFO L78 Accepts]: Start accepts. Automaton has 35315 states and 56006 transitions. Word has length 578 [2025-03-08 15:46:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:26,175 INFO L471 AbstractCegarLoop]: Abstraction has 35315 states and 56006 transitions. [2025-03-08 15:46:26,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 15:46:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 35315 states and 56006 transitions. [2025-03-08 15:46:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-08 15:46:26,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:26,183 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:26,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:46:26,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 384529881, now seen corresponding path program 1 times [2025-03-08 15:46:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198309797] [2025-03-08 15:46:26,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:26,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-08 15:46:28,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-08 15:46:28,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:28,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 54 proven. 201 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 15:46:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198309797] [2025-03-08 15:46:28,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198309797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085237933] [2025-03-08 15:46:28,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:28,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:28,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:28,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:46:28,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:46:28,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-08 15:46:28,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-08 15:46:28,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:28,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:28,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:46:28,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 5325 proven. 195 refuted. 0 times theorem prover too weak. 9100 trivial. 0 not checked. [2025-03-08 15:46:29,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:46:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 60 proven. 195 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 15:46:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085237933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:46:30,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:46:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:46:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451945685] [2025-03-08 15:46:30,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:46:30,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:46:30,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:30,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:46:30,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:46:30,214 INFO L87 Difference]: Start difference. First operand 35315 states and 56006 transitions. Second operand has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 3 states have call successors, (218), 2 states have call predecessors, (218), 4 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) [2025-03-08 15:46:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:31,585 INFO L93 Difference]: Finished difference Result 62403 states and 98526 transitions. [2025-03-08 15:46:31,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:46:31,586 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 3 states have call successors, (218), 2 states have call predecessors, (218), 4 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) Word has length 578 [2025-03-08 15:46:31,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:31,658 INFO L225 Difference]: With dead ends: 62403 [2025-03-08 15:46:31,658 INFO L226 Difference]: Without dead ends: 28135 [2025-03-08 15:46:31,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1170 GetRequests, 1153 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:46:31,686 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 1269 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:31,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1133 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:46:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28135 states. [2025-03-08 15:46:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28135 to 27221. [2025-03-08 15:46:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27221 states, 25017 states have (on average 1.5400727505296399) internal successors, (38528), 25059 states have internal predecessors, (38528), 1994 states have call successors, (1994), 209 states have call predecessors, (1994), 209 states have return successors, (1994), 1952 states have call predecessors, (1994), 1994 states have call successors, (1994) [2025-03-08 15:46:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27221 states to 27221 states and 42516 transitions. [2025-03-08 15:46:32,454 INFO L78 Accepts]: Start accepts. Automaton has 27221 states and 42516 transitions. Word has length 578 [2025-03-08 15:46:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:32,455 INFO L471 AbstractCegarLoop]: Abstraction has 27221 states and 42516 transitions. [2025-03-08 15:46:32,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 3 states have call successors, (218), 2 states have call predecessors, (218), 4 states have return successors, (220), 3 states have call predecessors, (220), 3 states have call successors, (220) [2025-03-08 15:46:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 27221 states and 42516 transitions. [2025-03-08 15:46:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-08 15:46:32,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:32,461 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:32,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:46:32,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 15:46:32,662 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:32,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash -527022590, now seen corresponding path program 1 times [2025-03-08 15:46:32,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:32,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896503668] [2025-03-08 15:46:32,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:32,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:32,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-08 15:46:32,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-08 15:46:32,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:32,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896503668] [2025-03-08 15:46:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896503668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:46:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676387185] [2025-03-08 15:46:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:38,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:46:38,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:38,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:46:38,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:46:38,626 INFO L87 Difference]: Start difference. First operand 27221 states and 42516 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:46:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:42,568 INFO L93 Difference]: Finished difference Result 93779 states and 147089 transitions. [2025-03-08 15:46:42,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:46:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 581 [2025-03-08 15:46:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:42,696 INFO L225 Difference]: With dead ends: 93779 [2025-03-08 15:46:42,697 INFO L226 Difference]: Without dead ends: 68911 [2025-03-08 15:46:42,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:46:42,738 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1767 mSDsluCounter, 2392 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:42,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 2858 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 15:46:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68911 states. [2025-03-08 15:46:43,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68911 to 34788. [2025-03-08 15:46:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34788 states, 32584 states have (on average 1.5533083722072183) internal successors, (50613), 32626 states have internal predecessors, (50613), 1994 states have call successors, (1994), 209 states have call predecessors, (1994), 209 states have return successors, (1994), 1952 states have call predecessors, (1994), 1994 states have call successors, (1994) [2025-03-08 15:46:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34788 states to 34788 states and 54601 transitions. [2025-03-08 15:46:43,715 INFO L78 Accepts]: Start accepts. Automaton has 34788 states and 54601 transitions. Word has length 581 [2025-03-08 15:46:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:43,716 INFO L471 AbstractCegarLoop]: Abstraction has 34788 states and 54601 transitions. [2025-03-08 15:46:43,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 8 states have internal predecessors, (154), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 15:46:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 34788 states and 54601 transitions. [2025-03-08 15:46:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-08 15:46:43,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:43,723 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:43,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:46:43,723 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:43,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1690735363, now seen corresponding path program 1 times [2025-03-08 15:46:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:43,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222236688] [2025-03-08 15:46:43,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:43,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-08 15:46:44,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-08 15:46:44,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:44,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 15:46:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222236688] [2025-03-08 15:46:53,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222236688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:53,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:53,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:46:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161889570] [2025-03-08 15:46:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:46:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:53,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:46:53,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:46:53,237 INFO L87 Difference]: Start difference. First operand 34788 states and 54601 transitions. Second operand has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 4 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2025-03-08 15:47:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:11,215 INFO L93 Difference]: Finished difference Result 128164 states and 197982 transitions. [2025-03-08 15:47:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:47:11,216 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 4 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) Word has length 581 [2025-03-08 15:47:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:11,412 INFO L225 Difference]: With dead ends: 128164 [2025-03-08 15:47:11,412 INFO L226 Difference]: Without dead ends: 96166 [2025-03-08 15:47:11,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2025-03-08 15:47:11,456 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 2705 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 5237 mSolverCounterSat, 953 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 5122 SdHoareTripleChecker+Invalid, 6190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 953 IncrementalHoareTripleChecker+Valid, 5237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:11,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2705 Valid, 5122 Invalid, 6190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [953 Valid, 5237 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-03-08 15:47:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96166 states. [2025-03-08 15:47:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96166 to 56326. [2025-03-08 15:47:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56326 states, 53034 states have (on average 1.5361843345778181) internal successors, (81470), 53100 states have internal predecessors, (81470), 2906 states have call successors, (2906), 385 states have call predecessors, (2906), 385 states have return successors, (2906), 2840 states have call predecessors, (2906), 2906 states have call successors, (2906) [2025-03-08 15:47:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56326 states to 56326 states and 87282 transitions. [2025-03-08 15:47:15,073 INFO L78 Accepts]: Start accepts. Automaton has 56326 states and 87282 transitions. Word has length 581 [2025-03-08 15:47:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:15,074 INFO L471 AbstractCegarLoop]: Abstraction has 56326 states and 87282 transitions. [2025-03-08 15:47:15,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.625) internal successors, (154), 16 states have internal predecessors, (154), 4 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2025-03-08 15:47:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 56326 states and 87282 transitions. [2025-03-08 15:47:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-08 15:47:15,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:15,084 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:47:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:47:15,084 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1471041340, now seen corresponding path program 1 times [2025-03-08 15:47:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129501488] [2025-03-08 15:47:15,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:15,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-08 15:47:15,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-08 15:47:15,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:15,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 78 proven. 177 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 15:47:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129501488] [2025-03-08 15:47:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129501488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:16,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107881812] [2025-03-08 15:47:16,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:16,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:16,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:16,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:16,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:47:16,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-08 15:47:16,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-08 15:47:16,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:16,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:16,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:47:16,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 3973 proven. 39 refuted. 0 times theorem prover too weak. 10608 trivial. 0 not checked. [2025-03-08 15:47:16,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 216 proven. 39 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-08 15:47:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107881812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:17,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:47:17,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202262857] [2025-03-08 15:47:17,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:17,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:47:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:17,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:47:17,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:47:17,226 INFO L87 Difference]: Start difference. First operand 56326 states and 87282 transitions. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 3 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (160), 3 states have call predecessors, (160), 3 states have call successors, (160)