./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-12.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-12.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 e76f98806e1a295fb78f8f1dda231a882e312782f15d8b64a58205cca62d9cda --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:40:55,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:40:55,496 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:40:55,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:40:55,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:40:55,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:40:55,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:40:55,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:40:55,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:40:55,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:40:55,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:40:55,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:40:55,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:40:55,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:40:55,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:40:55,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:40:55,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:40:55,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:40:55,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:40:55,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:40:55,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:40:55,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:40:55,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:40:55,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:40:55,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:40:55,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:40:55,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:40:55,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:40:55,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:40:55,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:40:55,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:40:55,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:40:55,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:40:55,526 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 -> e76f98806e1a295fb78f8f1dda231a882e312782f15d8b64a58205cca62d9cda [2025-03-08 15:40:55,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:40:55,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:40:55,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:40:55,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:40:55,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:40:55,767 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-12.i [2025-03-08 15:40:56,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988203d33/4ff164eb831d445ca0a8deae392196c1/FLAG03ff0f7e9 [2025-03-08 15:40:57,184 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:40:57,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-12.i [2025-03-08 15:40:57,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988203d33/4ff164eb831d445ca0a8deae392196c1/FLAG03ff0f7e9 [2025-03-08 15:40:57,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988203d33/4ff164eb831d445ca0a8deae392196c1 [2025-03-08 15:40:57,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:40:57,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:40:57,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:40:57,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:40:57,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:40:57,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:57,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57, skipping insertion in model container [2025-03-08 15:40:57,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:57,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:40:57,608 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-12.i[916,929] [2025-03-08 15:40:57,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:40:57,813 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:40:57,823 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-12.i[916,929] [2025-03-08 15:40:57,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:40:57,935 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:40:57,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57 WrapperNode [2025-03-08 15:40:57,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:40:57,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:40:57,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:40:57,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:40:57,941 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:40:57" (1/1) ... [2025-03-08 15:40:57,956 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:40:57" (1/1) ... [2025-03-08 15:40:58,026 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 864 [2025-03-08 15:40:58,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:40:58,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:40:58,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:40:58,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:40:58,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,099 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:40:58,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:40:58,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:40:58,169 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:40:58,169 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:40:58,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (1/1) ... [2025-03-08 15:40:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:40:58,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:40:58,196 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:40:58,198 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:40:58,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:40:58,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:40:58,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:40:58,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:40:58,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:40:58,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:40:58,364 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:40:58,366 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:40:59,257 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~ite62#1;havoc property_#t~ite61#1;havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short63#1;havoc property_#t~ite67#1;havoc property_#t~ite66#1;havoc property_#t~ite65#1;havoc property_#t~bitwise64#1;havoc property_#t~short68#1;havoc property_#t~bitwise69#1;havoc property_#t~short70#1;havoc property_#t~bitwise71#1;havoc property_#t~short72#1;havoc property_#t~ite74#1;havoc property_#t~bitwise73#1;havoc property_#t~short75#1;havoc property_#t~ite77#1;havoc property_#t~bitwise76#1;havoc property_#t~short78#1;havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~bitwise79#1;havoc property_#t~short82#1; [2025-03-08 15:40:59,393 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-08 15:40:59,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:40:59,417 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:40:59,417 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:40:59,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:40:59 BoogieIcfgContainer [2025-03-08 15:40:59,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:40:59,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:40:59,420 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:40:59,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:40:59,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:40:57" (1/3) ... [2025-03-08 15:40:59,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2180ad62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:40:59, skipping insertion in model container [2025-03-08 15:40:59,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:57" (2/3) ... [2025-03-08 15:40:59,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2180ad62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:40:59, skipping insertion in model container [2025-03-08 15:40:59,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:40:59" (3/3) ... [2025-03-08 15:40:59,425 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-12.i [2025-03-08 15:40:59,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:40:59,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-12.i that has 2 procedures, 343 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:40:59,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:40:59,496 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;@571fa8a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:40:59,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:40:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 275 states have (on average 1.549090909090909) internal successors, (426), 276 states have internal predecessors, (426), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 15:40:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-08 15:40:59,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:59,528 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:59,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1616532297, now seen corresponding path program 1 times [2025-03-08 15:40:59,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332418748] [2025-03-08 15:40:59,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:59,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:59,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-08 15:40:59,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-08 15:40:59,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:59,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:00,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:00,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332418748] [2025-03-08 15:41:00,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332418748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:00,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:00,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747626845] [2025-03-08 15:41:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:00,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:00,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:00,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:00,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:00,374 INFO L87 Difference]: Start difference. First operand has 343 states, 275 states have (on average 1.549090909090909) internal successors, (426), 276 states have internal predecessors, (426), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:00,590 INFO L93 Difference]: Finished difference Result 966 states and 1674 transitions. [2025-03-08 15:41:00,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:00,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 466 [2025-03-08 15:41:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:00,604 INFO L225 Difference]: With dead ends: 966 [2025-03-08 15:41:00,606 INFO L226 Difference]: Without dead ends: 626 [2025-03-08 15:41:00,613 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:41:00,616 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 449 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:00,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1009 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-08 15:41:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 623. [2025-03-08 15:41:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 519 states have (on average 1.5472061657032756) internal successors, (803), 520 states have internal predecessors, (803), 101 states have call successors, (101), 2 states have call predecessors, (101), 2 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-08 15:41:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1005 transitions. [2025-03-08 15:41:00,712 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1005 transitions. Word has length 466 [2025-03-08 15:41:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:00,715 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1005 transitions. [2025-03-08 15:41:00,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1005 transitions. [2025-03-08 15:41:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-08 15:41:00,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:00,727 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:00,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 15:41:00,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:00,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -998200794, now seen corresponding path program 1 times [2025-03-08 15:41:00,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:00,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060170580] [2025-03-08 15:41:00,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:00,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:00,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-08 15:41:00,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-08 15:41:00,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:00,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:01,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:01,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060170580] [2025-03-08 15:41:01,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060170580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:01,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:01,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:01,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126588086] [2025-03-08 15:41:01,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:01,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:01,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:01,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:01,216 INFO L87 Difference]: Start difference. First operand 623 states and 1005 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:01,411 INFO L93 Difference]: Finished difference Result 1861 states and 3005 transitions. [2025-03-08 15:41:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 467 [2025-03-08 15:41:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:01,424 INFO L225 Difference]: With dead ends: 1861 [2025-03-08 15:41:01,426 INFO L226 Difference]: Without dead ends: 1241 [2025-03-08 15:41:01,428 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:41:01,430 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 480 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:01,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1246 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-08 15:41:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-03-08 15:41:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1032 states have (on average 1.5436046511627908) internal successors, (1593), 1034 states have internal predecessors, (1593), 202 states have call successors, (202), 4 states have call predecessors, (202), 4 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2025-03-08 15:41:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1997 transitions. [2025-03-08 15:41:01,548 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1997 transitions. Word has length 467 [2025-03-08 15:41:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1997 transitions. [2025-03-08 15:41:01,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1997 transitions. [2025-03-08 15:41:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-08 15:41:01,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:01,560 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:01,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:41:01,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:01,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash -826632377, now seen corresponding path program 1 times [2025-03-08 15:41:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:01,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574873912] [2025-03-08 15:41:01,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:01,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-08 15:41:01,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-08 15:41:01,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:01,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:02,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:02,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574873912] [2025-03-08 15:41:02,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574873912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:02,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:02,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:02,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990465132] [2025-03-08 15:41:02,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:02,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:02,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:02,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:02,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:02,108 INFO L87 Difference]: Start difference. First operand 1239 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:02,293 INFO L93 Difference]: Finished difference Result 3695 states and 5969 transitions. [2025-03-08 15:41:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:02,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 467 [2025-03-08 15:41:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:02,305 INFO L225 Difference]: With dead ends: 3695 [2025-03-08 15:41:02,305 INFO L226 Difference]: Without dead ends: 2459 [2025-03-08 15:41:02,308 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:41:02,309 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 531 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:02,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1337 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2025-03-08 15:41:02,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2453. [2025-03-08 15:41:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2040 states have (on average 1.5362745098039217) internal successors, (3134), 2044 states have internal predecessors, (3134), 404 states have call successors, (404), 8 states have call predecessors, (404), 8 states have return successors, (404), 400 states have call predecessors, (404), 404 states have call successors, (404) [2025-03-08 15:41:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3942 transitions. [2025-03-08 15:41:02,454 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3942 transitions. Word has length 467 [2025-03-08 15:41:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:02,455 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3942 transitions. [2025-03-08 15:41:02,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3942 transitions. [2025-03-08 15:41:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 15:41:02,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:02,462 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:02,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:41:02,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:02,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:02,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2139425231, now seen corresponding path program 1 times [2025-03-08 15:41:02,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976846215] [2025-03-08 15:41:02,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:02,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:02,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 15:41:02,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 15:41:02,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:02,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:03,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976846215] [2025-03-08 15:41:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976846215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:03,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:03,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542528777] [2025-03-08 15:41:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:03,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:03,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:03,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:03,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:03,002 INFO L87 Difference]: Start difference. First operand 2453 states and 3942 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:03,608 INFO L93 Difference]: Finished difference Result 8295 states and 13285 transitions. [2025-03-08 15:41:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:41:03,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 468 [2025-03-08 15:41:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:03,636 INFO L225 Difference]: With dead ends: 8295 [2025-03-08 15:41:03,637 INFO L226 Difference]: Without dead ends: 5845 [2025-03-08 15:41:03,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:03,647 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 992 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:03,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 1545 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:41:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5845 states. [2025-03-08 15:41:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5845 to 5753. [2025-03-08 15:41:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5753 states, 4928 states have (on average 1.541396103896104) internal successors, (7596), 4936 states have internal predecessors, (7596), 808 states have call successors, (808), 16 states have call predecessors, (808), 16 states have return successors, (808), 800 states have call predecessors, (808), 808 states have call successors, (808) [2025-03-08 15:41:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5753 states to 5753 states and 9212 transitions. [2025-03-08 15:41:03,901 INFO L78 Accepts]: Start accepts. Automaton has 5753 states and 9212 transitions. Word has length 468 [2025-03-08 15:41:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:03,902 INFO L471 AbstractCegarLoop]: Abstraction has 5753 states and 9212 transitions. [2025-03-08 15:41:03,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 5753 states and 9212 transitions. [2025-03-08 15:41:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 15:41:03,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:03,949 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:03,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:41:03,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:03,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1998439793, now seen corresponding path program 1 times [2025-03-08 15:41:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211086679] [2025-03-08 15:41:03,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:03,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 15:41:04,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 15:41:04,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:04,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:04,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211086679] [2025-03-08 15:41:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211086679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:04,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:04,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126266573] [2025-03-08 15:41:04,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:04,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:04,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:04,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:04,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:04,489 INFO L87 Difference]: Start difference. First operand 5753 states and 9212 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:04,981 INFO L93 Difference]: Finished difference Result 14258 states and 22782 transitions. [2025-03-08 15:41:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:41:04,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 468 [2025-03-08 15:41:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:05,018 INFO L225 Difference]: With dead ends: 14258 [2025-03-08 15:41:05,018 INFO L226 Difference]: Without dead ends: 8508 [2025-03-08 15:41:05,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:05,034 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 525 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:05,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1543 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:41:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2025-03-08 15:41:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 5942. [2025-03-08 15:41:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5942 states, 5050 states have (on average 1.5368316831683169) internal successors, (7761), 5058 states have internal predecessors, (7761), 873 states have call successors, (873), 18 states have call predecessors, (873), 18 states have return successors, (873), 865 states have call predecessors, (873), 873 states have call successors, (873) [2025-03-08 15:41:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5942 states to 5942 states and 9507 transitions. [2025-03-08 15:41:05,333 INFO L78 Accepts]: Start accepts. Automaton has 5942 states and 9507 transitions. Word has length 468 [2025-03-08 15:41:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:05,334 INFO L471 AbstractCegarLoop]: Abstraction has 5942 states and 9507 transitions. [2025-03-08 15:41:05,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 5942 states and 9507 transitions. [2025-03-08 15:41:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-08 15:41:05,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:05,344 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:41:05,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:05,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash 905644686, now seen corresponding path program 1 times [2025-03-08 15:41:05,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:05,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390247790] [2025-03-08 15:41:05,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:05,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-08 15:41:05,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-08 15:41:05,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:05,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:05,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:05,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390247790] [2025-03-08 15:41:05,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390247790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:05,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:05,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891522091] [2025-03-08 15:41:05,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:05,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:05,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:05,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:05,899 INFO L87 Difference]: Start difference. First operand 5942 states and 9507 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:06,503 INFO L93 Difference]: Finished difference Result 19122 states and 30501 transitions. [2025-03-08 15:41:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:41:06,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 468 [2025-03-08 15:41:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:06,557 INFO L225 Difference]: With dead ends: 19122 [2025-03-08 15:41:06,557 INFO L226 Difference]: Without dead ends: 13320 [2025-03-08 15:41:06,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:06,577 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 1416 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:06,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1580 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:41:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13320 states. [2025-03-08 15:41:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13320 to 8018. [2025-03-08 15:41:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8018 states, 6590 states have (on average 1.512443095599393) internal successors, (9967), 6598 states have internal predecessors, (9967), 1393 states have call successors, (1393), 34 states have call predecessors, (1393), 34 states have return successors, (1393), 1385 states have call predecessors, (1393), 1393 states have call successors, (1393) [2025-03-08 15:41:06,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8018 states to 8018 states and 12753 transitions. [2025-03-08 15:41:06,986 INFO L78 Accepts]: Start accepts. Automaton has 8018 states and 12753 transitions. Word has length 468 [2025-03-08 15:41:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:06,987 INFO L471 AbstractCegarLoop]: Abstraction has 8018 states and 12753 transitions. [2025-03-08 15:41:06,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8018 states and 12753 transitions. [2025-03-08 15:41:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-08 15:41:06,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:06,997 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:06,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:41:06,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:06,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1553231764, now seen corresponding path program 1 times [2025-03-08 15:41:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375946980] [2025-03-08 15:41:06,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:07,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 15:41:07,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 15:41:07,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:07,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375946980] [2025-03-08 15:41:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375946980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:07,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:07,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:07,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710319917] [2025-03-08 15:41:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:07,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:07,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:07,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:07,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:07,484 INFO L87 Difference]: Start difference. First operand 8018 states and 12753 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:07,894 INFO L93 Difference]: Finished difference Result 19786 states and 31489 transitions. [2025-03-08 15:41:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:07,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 469 [2025-03-08 15:41:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:07,932 INFO L225 Difference]: With dead ends: 19786 [2025-03-08 15:41:07,933 INFO L226 Difference]: Without dead ends: 11946 [2025-03-08 15:41:07,953 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:41:07,954 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 418 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:07,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1025 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11946 states. [2025-03-08 15:41:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11946 to 11944. [2025-03-08 15:41:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11944 states, 9836 states have (on average 1.511285075233835) internal successors, (14865), 9848 states have internal predecessors, (14865), 2057 states have call successors, (2057), 50 states have call predecessors, (2057), 50 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-03-08 15:41:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11944 states to 11944 states and 18979 transitions. [2025-03-08 15:41:08,503 INFO L78 Accepts]: Start accepts. Automaton has 11944 states and 18979 transitions. Word has length 469 [2025-03-08 15:41:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:08,504 INFO L471 AbstractCegarLoop]: Abstraction has 11944 states and 18979 transitions. [2025-03-08 15:41:08,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 11944 states and 18979 transitions. [2025-03-08 15:41:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-08 15:41:08,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:08,517 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:41:08,518 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:08,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash 172421108, now seen corresponding path program 1 times [2025-03-08 15:41:08,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:08,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303242827] [2025-03-08 15:41:08,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:08,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:08,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 15:41:08,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 15:41:08,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:08,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303242827] [2025-03-08 15:41:08,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303242827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:08,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:41:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999831405] [2025-03-08 15:41:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:08,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:41:08,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:08,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:41:08,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:08,936 INFO L87 Difference]: Start difference. First operand 11944 states and 18979 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:09,526 INFO L93 Difference]: Finished difference Result 28294 states and 44913 transitions. [2025-03-08 15:41:09,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:41:09,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 469 [2025-03-08 15:41:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:09,575 INFO L225 Difference]: With dead ends: 28294 [2025-03-08 15:41:09,576 INFO L226 Difference]: Without dead ends: 16564 [2025-03-08 15:41:09,605 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:41:09,606 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 505 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:09,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2060 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:41:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16564 states. [2025-03-08 15:41:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16564 to 11944. [2025-03-08 15:41:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11944 states, 9836 states have (on average 1.5100650671004474) internal successors, (14853), 9848 states have internal predecessors, (14853), 2057 states have call successors, (2057), 50 states have call predecessors, (2057), 50 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-03-08 15:41:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11944 states to 11944 states and 18967 transitions. [2025-03-08 15:41:10,113 INFO L78 Accepts]: Start accepts. Automaton has 11944 states and 18967 transitions. Word has length 469 [2025-03-08 15:41:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:10,114 INFO L471 AbstractCegarLoop]: Abstraction has 11944 states and 18967 transitions. [2025-03-08 15:41:10,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 11944 states and 18967 transitions. [2025-03-08 15:41:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 15:41:10,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:10,123 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:10,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:41:10,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:10,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash 259689722, now seen corresponding path program 1 times [2025-03-08 15:41:10,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:10,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769202705] [2025-03-08 15:41:10,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 15:41:10,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 15:41:10,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:10,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:10,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:10,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769202705] [2025-03-08 15:41:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769202705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:10,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996052793] [2025-03-08 15:41:10,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:10,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:10,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:10,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:10,498 INFO L87 Difference]: Start difference. First operand 11944 states and 18967 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:10,999 INFO L93 Difference]: Finished difference Result 35404 states and 56277 transitions. [2025-03-08 15:41:10,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:10,999 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 470 [2025-03-08 15:41:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:11,076 INFO L225 Difference]: With dead ends: 35404 [2025-03-08 15:41:11,077 INFO L226 Difference]: Without dead ends: 23674 [2025-03-08 15:41:11,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:41:11,106 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 520 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:11,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1514 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23674 states. [2025-03-08 15:41:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23674 to 12532. [2025-03-08 15:41:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12532 states, 10424 states have (on average 1.5123752877973906) internal successors, (15765), 10436 states have internal predecessors, (15765), 2057 states have call successors, (2057), 50 states have call predecessors, (2057), 50 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-03-08 15:41:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12532 states to 12532 states and 19879 transitions. [2025-03-08 15:41:11,958 INFO L78 Accepts]: Start accepts. Automaton has 12532 states and 19879 transitions. Word has length 470 [2025-03-08 15:41:11,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:11,960 INFO L471 AbstractCegarLoop]: Abstraction has 12532 states and 19879 transitions. [2025-03-08 15:41:11,960 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 12532 states and 19879 transitions. [2025-03-08 15:41:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 15:41:11,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:11,972 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:41:11,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:11,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash 273222523, now seen corresponding path program 1 times [2025-03-08 15:41:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:11,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577816156] [2025-03-08 15:41:11,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:12,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 15:41:12,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 15:41:12,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:12,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:12,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577816156] [2025-03-08 15:41:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577816156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:12,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:12,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:12,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800131544] [2025-03-08 15:41:12,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:12,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:12,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:12,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:12,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:12,170 INFO L87 Difference]: Start difference. First operand 12532 states and 19879 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:12,846 INFO L93 Difference]: Finished difference Result 34640 states and 54924 transitions. [2025-03-08 15:41:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:12,846 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 470 [2025-03-08 15:41:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:12,921 INFO L225 Difference]: With dead ends: 34640 [2025-03-08 15:41:12,921 INFO L226 Difference]: Without dead ends: 22322 [2025-03-08 15:41:12,949 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:41:12,950 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 412 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:12,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1025 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22322 states. [2025-03-08 15:41:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22322 to 22296. [2025-03-08 15:41:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22296 states, 18699 states have (on average 1.5129151291512914) internal successors, (28290), 18747 states have internal predecessors, (28290), 3497 states have call successors, (3497), 99 states have call predecessors, (3497), 99 states have return successors, (3497), 3449 states have call predecessors, (3497), 3497 states have call successors, (3497) [2025-03-08 15:41:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22296 states to 22296 states and 35284 transitions. [2025-03-08 15:41:13,738 INFO L78 Accepts]: Start accepts. Automaton has 22296 states and 35284 transitions. Word has length 470 [2025-03-08 15:41:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:13,739 INFO L471 AbstractCegarLoop]: Abstraction has 22296 states and 35284 transitions. [2025-03-08 15:41:13,739 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22296 states and 35284 transitions. [2025-03-08 15:41:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 15:41:13,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:13,756 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:13,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:41:13,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:13,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash 692739354, now seen corresponding path program 1 times [2025-03-08 15:41:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:13,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840524865] [2025-03-08 15:41:13,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:13,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 15:41:13,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 15:41:13,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:13,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840524865] [2025-03-08 15:41:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840524865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:13,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:41:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153973498] [2025-03-08 15:41:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:13,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:41:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:13,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:41:13,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:41:13,976 INFO L87 Difference]: Start difference. First operand 22296 states and 35284 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:14,448 INFO L93 Difference]: Finished difference Result 43980 states and 69510 transitions. [2025-03-08 15:41:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:41:14,449 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 470 [2025-03-08 15:41:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:14,524 INFO L225 Difference]: With dead ends: 43980 [2025-03-08 15:41:14,525 INFO L226 Difference]: Without dead ends: 21902 [2025-03-08 15:41:14,565 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:41:14,567 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 407 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:14,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1175 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:41:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21902 states. [2025-03-08 15:41:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21902 to 12656. [2025-03-08 15:41:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12656 states, 10523 states have (on average 1.5007127245082201) internal successors, (15792), 10535 states have internal predecessors, (15792), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-03-08 15:41:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12656 states to 12656 states and 19906 transitions. [2025-03-08 15:41:15,144 INFO L78 Accepts]: Start accepts. Automaton has 12656 states and 19906 transitions. Word has length 470 [2025-03-08 15:41:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:15,145 INFO L471 AbstractCegarLoop]: Abstraction has 12656 states and 19906 transitions. [2025-03-08 15:41:15,145 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, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 12656 states and 19906 transitions. [2025-03-08 15:41:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-08 15:41:15,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:15,154 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:41:15,154 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:15,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:15,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1136350777, now seen corresponding path program 1 times [2025-03-08 15:41:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937007552] [2025-03-08 15:41:15,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:15,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-08 15:41:15,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-08 15:41:15,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:15,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:15,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937007552] [2025-03-08 15:41:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937007552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:15,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:15,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:15,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111713846] [2025-03-08 15:41:15,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:15,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:15,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:15,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:15,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:15,633 INFO L87 Difference]: Start difference. First operand 12656 states and 19906 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:16,931 INFO L93 Difference]: Finished difference Result 45589 states and 71786 transitions. [2025-03-08 15:41:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:41:16,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 470 [2025-03-08 15:41:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:17,026 INFO L225 Difference]: With dead ends: 45589 [2025-03-08 15:41:17,026 INFO L226 Difference]: Without dead ends: 33151 [2025-03-08 15:41:17,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:41:17,059 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 833 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:17,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1823 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:41:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33151 states. [2025-03-08 15:41:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33151 to 18599. [2025-03-08 15:41:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18599 states, 16466 states have (on average 1.5476132636948865) internal successors, (25483), 16478 states have internal predecessors, (25483), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-03-08 15:41:18,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18599 states to 18599 states and 29597 transitions. [2025-03-08 15:41:18,196 INFO L78 Accepts]: Start accepts. Automaton has 18599 states and 29597 transitions. Word has length 470 [2025-03-08 15:41:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:18,197 INFO L471 AbstractCegarLoop]: Abstraction has 18599 states and 29597 transitions. [2025-03-08 15:41:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18599 states and 29597 transitions. [2025-03-08 15:41:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-08 15:41:18,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:18,212 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:18,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:41:18,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:18,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash -999739440, now seen corresponding path program 1 times [2025-03-08 15:41:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:18,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478356726] [2025-03-08 15:41:18,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:18,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-08 15:41:18,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-08 15:41:18,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:18,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:19,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478356726] [2025-03-08 15:41:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478356726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:19,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:41:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552787659] [2025-03-08 15:41:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:19,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:41:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:19,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:41:19,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:19,102 INFO L87 Difference]: Start difference. First operand 18599 states and 29597 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:19,965 INFO L93 Difference]: Finished difference Result 45092 states and 71781 transitions. [2025-03-08 15:41:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:41:19,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 471 [2025-03-08 15:41:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:20,030 INFO L225 Difference]: With dead ends: 45092 [2025-03-08 15:41:20,030 INFO L226 Difference]: Without dead ends: 26658 [2025-03-08 15:41:20,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:41:20,056 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 479 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:20,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1926 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:41:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26658 states. [2025-03-08 15:41:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26658 to 18599. [2025-03-08 15:41:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18599 states, 16466 states have (on average 1.5473703388801165) internal successors, (25479), 16478 states have internal predecessors, (25479), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-03-08 15:41:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18599 states to 18599 states and 29593 transitions. [2025-03-08 15:41:20,659 INFO L78 Accepts]: Start accepts. Automaton has 18599 states and 29593 transitions. Word has length 471 [2025-03-08 15:41:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:20,660 INFO L471 AbstractCegarLoop]: Abstraction has 18599 states and 29593 transitions. [2025-03-08 15:41:20,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 18599 states and 29593 transitions. [2025-03-08 15:41:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 15:41:20,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:20,674 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:20,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:41:20,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:20,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash -910272814, now seen corresponding path program 1 times [2025-03-08 15:41:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356987731] [2025-03-08 15:41:20,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:20,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:20,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 15:41:20,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 15:41:20,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:20,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:21,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:21,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356987731] [2025-03-08 15:41:21,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356987731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:21,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:21,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:41:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251451708] [2025-03-08 15:41:21,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:21,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:41:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:21,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:41:21,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:41:21,262 INFO L87 Difference]: Start difference. First operand 18599 states and 29593 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:22,106 INFO L93 Difference]: Finished difference Result 45092 states and 71777 transitions. [2025-03-08 15:41:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:41:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 472 [2025-03-08 15:41:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:22,169 INFO L225 Difference]: With dead ends: 45092 [2025-03-08 15:41:22,169 INFO L226 Difference]: Without dead ends: 26658 [2025-03-08 15:41:22,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:41:22,203 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 447 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:22,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2393 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:41:22,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26658 states. [2025-03-08 15:41:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26658 to 18599. [2025-03-08 15:41:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18599 states, 16466 states have (on average 1.5466415644358071) internal successors, (25467), 16478 states have internal predecessors, (25467), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-03-08 15:41:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18599 states to 18599 states and 29581 transitions. [2025-03-08 15:41:22,878 INFO L78 Accepts]: Start accepts. Automaton has 18599 states and 29581 transitions. Word has length 472 [2025-03-08 15:41:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:22,879 INFO L471 AbstractCegarLoop]: Abstraction has 18599 states and 29581 transitions. [2025-03-08 15:41:22,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18599 states and 29581 transitions. [2025-03-08 15:41:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-08 15:41:22,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:22,889 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:22,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:41:22,890 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:22,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:22,890 INFO L85 PathProgramCache]: Analyzing trace with hash -231927723, now seen corresponding path program 1 times [2025-03-08 15:41:22,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:22,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940576006] [2025-03-08 15:41:22,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:22,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-08 15:41:22,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-08 15:41:22,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:22,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:23,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940576006] [2025-03-08 15:41:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940576006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:23,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:23,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:41:23,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297448366] [2025-03-08 15:41:23,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:23,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:41:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:23,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:41:23,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:23,261 INFO L87 Difference]: Start difference. First operand 18599 states and 29581 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:24,291 INFO L93 Difference]: Finished difference Result 45092 states and 71761 transitions. [2025-03-08 15:41:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:41:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 473 [2025-03-08 15:41:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:24,403 INFO L225 Difference]: With dead ends: 45092 [2025-03-08 15:41:24,404 INFO L226 Difference]: Without dead ends: 26658 [2025-03-08 15:41:24,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:41:24,440 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 441 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:24,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1884 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:41:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26658 states. [2025-03-08 15:41:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26658 to 18599. [2025-03-08 15:41:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18599 states, 16466 states have (on average 1.5463986396210372) internal successors, (25463), 16478 states have internal predecessors, (25463), 2057 states have call successors, (2057), 75 states have call predecessors, (2057), 75 states have return successors, (2057), 2045 states have call predecessors, (2057), 2057 states have call successors, (2057) [2025-03-08 15:41:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18599 states to 18599 states and 29577 transitions. [2025-03-08 15:41:25,143 INFO L78 Accepts]: Start accepts. Automaton has 18599 states and 29577 transitions. Word has length 473 [2025-03-08 15:41:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:25,144 INFO L471 AbstractCegarLoop]: Abstraction has 18599 states and 29577 transitions. [2025-03-08 15:41:25,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 18599 states and 29577 transitions. [2025-03-08 15:41:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-08 15:41:25,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:25,153 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:41:25,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:25,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1208784494, now seen corresponding path program 1 times [2025-03-08 15:41:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:25,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203847954] [2025-03-08 15:41:25,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:25,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:25,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-08 15:41:25,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-08 15:41:25,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:25,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203847954] [2025-03-08 15:41:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203847954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:26,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:26,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:41:26,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646943255] [2025-03-08 15:41:26,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:26,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:41:26,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:26,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:41:26,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:41:26,813 INFO L87 Difference]: Start difference. First operand 18599 states and 29577 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:29,966 INFO L93 Difference]: Finished difference Result 96347 states and 153207 transitions. [2025-03-08 15:41:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:41:29,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 474 [2025-03-08 15:41:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:30,115 INFO L225 Difference]: With dead ends: 96347 [2025-03-08 15:41:30,115 INFO L226 Difference]: Without dead ends: 78061 [2025-03-08 15:41:30,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:41:30,141 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 2206 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:30,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2206 Valid, 2617 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:41:30,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78061 states. [2025-03-08 15:41:32,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78061 to 61183. [2025-03-08 15:41:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61183 states, 57826 states have (on average 1.5920693113824231) internal successors, (92063), 57910 states have internal predecessors, (92063), 3209 states have call successors, (3209), 147 states have call predecessors, (3209), 147 states have return successors, (3209), 3125 states have call predecessors, (3209), 3209 states have call successors, (3209) [2025-03-08 15:41:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61183 states to 61183 states and 98481 transitions. [2025-03-08 15:41:32,334 INFO L78 Accepts]: Start accepts. Automaton has 61183 states and 98481 transitions. Word has length 474 [2025-03-08 15:41:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:32,334 INFO L471 AbstractCegarLoop]: Abstraction has 61183 states and 98481 transitions. [2025-03-08 15:41:32,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 61183 states and 98481 transitions. [2025-03-08 15:41:32,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-08 15:41:32,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:32,372 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:32,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:41:32,373 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:32,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:32,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1135882547, now seen corresponding path program 1 times [2025-03-08 15:41:32,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:32,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83309582] [2025-03-08 15:41:32,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:32,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-08 15:41:32,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-08 15:41:32,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:32,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:34,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83309582] [2025-03-08 15:41:34,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83309582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:41:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881471183] [2025-03-08 15:41:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:34,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:41:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:34,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:41:34,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:41:34,554 INFO L87 Difference]: Start difference. First operand 61183 states and 98481 transitions. Second operand has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:38,112 INFO L93 Difference]: Finished difference Result 154795 states and 249335 transitions. [2025-03-08 15:41:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:41:38,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 474 [2025-03-08 15:41:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:38,286 INFO L225 Difference]: With dead ends: 154795 [2025-03-08 15:41:38,286 INFO L226 Difference]: Without dead ends: 93925 [2025-03-08 15:41:38,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:41:38,335 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 964 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 3050 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:38,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 3050 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 15:41:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93925 states. [2025-03-08 15:41:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93925 to 79103. [2025-03-08 15:41:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79103 states, 75746 states have (on average 1.6244686188049533) internal successors, (123047), 75830 states have internal predecessors, (123047), 3209 states have call successors, (3209), 147 states have call predecessors, (3209), 147 states have return successors, (3209), 3125 states have call predecessors, (3209), 3209 states have call successors, (3209) [2025-03-08 15:41:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79103 states to 79103 states and 129465 transitions. [2025-03-08 15:41:40,749 INFO L78 Accepts]: Start accepts. Automaton has 79103 states and 129465 transitions. Word has length 474 [2025-03-08 15:41:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:40,750 INFO L471 AbstractCegarLoop]: Abstraction has 79103 states and 129465 transitions. [2025-03-08 15:41:40,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.88888888888889) internal successors, (152), 9 states have internal predecessors, (152), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 79103 states and 129465 transitions. [2025-03-08 15:41:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 15:41:40,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:40,791 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:40,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:41:40,792 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:40,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:40,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1602674465, now seen corresponding path program 1 times [2025-03-08 15:41:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:40,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713142059] [2025-03-08 15:41:40,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:40,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 15:41:41,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 15:41:41,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:41,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:41,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:41,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713142059] [2025-03-08 15:41:41,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713142059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:41,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:41,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:41,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142791056] [2025-03-08 15:41:41,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:41,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:41,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:41,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:41,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:41,424 INFO L87 Difference]: Start difference. First operand 79103 states and 129465 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:43,851 INFO L93 Difference]: Finished difference Result 227335 states and 372767 transitions. [2025-03-08 15:41:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:41:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 476 [2025-03-08 15:41:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:44,097 INFO L225 Difference]: With dead ends: 227335 [2025-03-08 15:41:44,097 INFO L226 Difference]: Without dead ends: 150861 [2025-03-08 15:41:44,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:44,184 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 364 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:44,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2090 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:41:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150861 states. [2025-03-08 15:41:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150861 to 147691. [2025-03-08 15:41:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147691 states, 141670 states have (on average 1.628891084915649) internal successors, (230765), 141862 states have internal predecessors, (230765), 5753 states have call successors, (5753), 267 states have call predecessors, (5753), 267 states have return successors, (5753), 5561 states have call predecessors, (5753), 5753 states have call successors, (5753) [2025-03-08 15:41:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147691 states to 147691 states and 242271 transitions. [2025-03-08 15:41:48,678 INFO L78 Accepts]: Start accepts. Automaton has 147691 states and 242271 transitions. Word has length 476 [2025-03-08 15:41:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:41:48,679 INFO L471 AbstractCegarLoop]: Abstraction has 147691 states and 242271 transitions. [2025-03-08 15:41:48,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 147691 states and 242271 transitions. [2025-03-08 15:41:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 15:41:48,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:41:48,769 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:48,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 15:41:48,770 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:41:48,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:41:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1356361378, now seen corresponding path program 1 times [2025-03-08 15:41:48,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:41:48,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988838355] [2025-03-08 15:41:48,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:41:48,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:41:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 15:41:48,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 15:41:48,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:41:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:41:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-08 15:41:49,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:41:49,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988838355] [2025-03-08 15:41:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988838355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:41:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:41:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:41:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975428003] [2025-03-08 15:41:49,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:41:49,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:41:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:41:49,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:41:49,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:41:49,067 INFO L87 Difference]: Start difference. First operand 147691 states and 242271 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-08 15:41:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:41:55,326 INFO L93 Difference]: Finished difference Result 427819 states and 701470 transitions. [2025-03-08 15:41:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:41:55,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 476 [2025-03-08 15:41:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:41:55,880 INFO L225 Difference]: With dead ends: 427819 [2025-03-08 15:41:55,880 INFO L226 Difference]: Without dead ends: 289641 [2025-03-08 15:41:55,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:41:55,994 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1145 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:41:55,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 2019 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:41:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289641 states.