./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-30.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-30.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 9a12fb13f4579599874276f15d887898a52c4d97dbae858ff08fc2462341b39d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:42:52,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:42:52,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:42:52,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:42:52,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:42:52,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:42:52,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:42:52,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:42:52,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:42:52,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:42:52,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:42:52,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:42:52,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:42:52,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:42:52,393 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:42:52,393 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:42:52,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:42:52,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:42:52,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:42:52,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:42:52,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:42:52,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:42:52,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:42:52,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:42:52,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:42:52,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:42:52,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:42:52,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:42:52,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:42:52,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:42:52,396 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 -> 9a12fb13f4579599874276f15d887898a52c4d97dbae858ff08fc2462341b39d [2025-03-08 15:42:52,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:42:52,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:42:52,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:42:52,622 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:42:52,622 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:42:52,623 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-30.i [2025-03-08 15:42:53,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e180a00da/d28fd9cac1124566a267e70eb2c77acf/FLAG4a77a69ca [2025-03-08 15:42:53,968 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:42:53,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-30.i [2025-03-08 15:42:53,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e180a00da/d28fd9cac1124566a267e70eb2c77acf/FLAG4a77a69ca [2025-03-08 15:42:54,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e180a00da/d28fd9cac1124566a267e70eb2c77acf [2025-03-08 15:42:54,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:42:54,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:42:54,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:42:54,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:42:54,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:42:54,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd20196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54, skipping insertion in model container [2025-03-08 15:42:54,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:42:54,409 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-30.i[916,929] [2025-03-08 15:42:54,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:42:54,560 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:42:54,566 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-30.i[916,929] [2025-03-08 15:42:54,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:42:54,657 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:42:54,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54 WrapperNode [2025-03-08 15:42:54,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:42:54,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:42:54,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:42:54,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:42:54,662 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:42:54" (1/1) ... [2025-03-08 15:42:54,681 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:42:54" (1/1) ... [2025-03-08 15:42:54,764 INFO L138 Inliner]: procedures = 26, calls = 98, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 786 [2025-03-08 15:42:54,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:42:54,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:42:54,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:42:54,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:42:54,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,852 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:42:54,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:42:54,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:42:54,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:42:54,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:42:54,913 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (1/1) ... [2025-03-08 15:42:54,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:42:54,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:42:54,939 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:42:54,944 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:42:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:42:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:42:54,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:42:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:42:54,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:42:54,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:42:55,087 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:42:55,088 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:42:55,950 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L657: havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~bitwise57#1;havoc property_#t~short58#1;havoc property_#t~short61#1;havoc property_#t~ite63#1;havoc property_#t~bitwise62#1;havoc property_#t~short64#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short67#1;havoc property_#t~ite69#1;havoc property_#t~bitwise68#1;havoc property_#t~short70#1;havoc property_#t~bitwise71#1;havoc property_#t~short72#1;havoc property_#t~bitwise73#1;havoc property_#t~short74#1; [2025-03-08 15:42:56,075 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-08 15:42:56,075 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:42:56,100 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:42:56,103 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:42:56,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:42:56 BoogieIcfgContainer [2025-03-08 15:42:56,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:42:56,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:42:56,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:42:56,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:42:56,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:42:54" (1/3) ... [2025-03-08 15:42:56,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcc773c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:42:56, skipping insertion in model container [2025-03-08 15:42:56,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:42:54" (2/3) ... [2025-03-08 15:42:56,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcc773c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:42:56, skipping insertion in model container [2025-03-08 15:42:56,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:42:56" (3/3) ... [2025-03-08 15:42:56,111 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-30.i [2025-03-08 15:42:56,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:42:56,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-30.i that has 2 procedures, 309 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:42:56,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:42:56,182 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;@3f0cc2b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:42:56,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:42:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 221 states have (on average 1.497737556561086) internal successors, (331), 222 states have internal predecessors, (331), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 15:42:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:42:56,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:56,215 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:56,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:56,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1094691486, now seen corresponding path program 1 times [2025-03-08 15:42:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98894973] [2025-03-08 15:42:56,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:56,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:42:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:42:56,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:56,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2025-03-08 15:42:56,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:56,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98894973] [2025-03-08 15:42:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98894973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:42:56,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709359782] [2025-03-08 15:42:56,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:56,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:42:56,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:42:56,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:42:56,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:42:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:42:57,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:42:57,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:57,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:57,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:42:57,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:42:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2025-03-08 15:42:57,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:42:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709359782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:57,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:42:57,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:42:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784826821] [2025-03-08 15:42:57,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:57,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:42:57,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:57,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:42:57,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:42:57,272 INFO L87 Difference]: Start difference. First operand has 309 states, 221 states have (on average 1.497737556561086) internal successors, (331), 222 states have internal predecessors, (331), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-08 15:42:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:57,333 INFO L93 Difference]: Finished difference Result 612 states and 1082 transitions. [2025-03-08 15:42:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:42:57,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) Word has length 563 [2025-03-08 15:42:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:57,342 INFO L225 Difference]: With dead ends: 612 [2025-03-08 15:42:57,342 INFO L226 Difference]: Without dead ends: 306 [2025-03-08 15:42:57,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:42:57,350 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:57,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:42:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-08 15:42:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-08 15:42:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 219 states have (on average 1.4885844748858448) internal successors, (326), 219 states have internal predecessors, (326), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 15:42:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 496 transitions. [2025-03-08 15:42:57,417 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 496 transitions. Word has length 563 [2025-03-08 15:42:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:57,418 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 496 transitions. [2025-03-08 15:42:57,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-08 15:42:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 496 transitions. [2025-03-08 15:42:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:42:57,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:57,426 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:42:57,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:42:57,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:57,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:57,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1664548037, now seen corresponding path program 1 times [2025-03-08 15:42:57,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:57,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864948942] [2025-03-08 15:42:57,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:57,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:42:57,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:42:57,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:57,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:42:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:58,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864948942] [2025-03-08 15:42:58,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864948942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:58,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:58,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:58,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031561555] [2025-03-08 15:42:58,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:58,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:58,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:58,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:58,378 INFO L87 Difference]: Start difference. First operand 306 states and 496 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-08 15:42:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:58,467 INFO L93 Difference]: Finished difference Result 609 states and 989 transitions. [2025-03-08 15:42:58,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:58,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) Word has length 563 [2025-03-08 15:42:58,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:58,473 INFO L225 Difference]: With dead ends: 609 [2025-03-08 15:42:58,473 INFO L226 Difference]: Without dead ends: 306 [2025-03-08 15:42:58,474 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:42:58,474 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 353 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:58,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 468 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-08 15:42:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-08 15:42:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 219 states have (on average 1.4840182648401827) internal successors, (325), 219 states have internal predecessors, (325), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-08 15:42:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 495 transitions. [2025-03-08 15:42:58,505 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 495 transitions. Word has length 563 [2025-03-08 15:42:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:58,508 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 495 transitions. [2025-03-08 15:42:58,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-08 15:42:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 495 transitions. [2025-03-08 15:42:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:42:58,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:58,517 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:58,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:42:58,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:58,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:58,519 INFO L85 PathProgramCache]: Analyzing trace with hash -848919324, now seen corresponding path program 1 times [2025-03-08 15:42:58,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035443656] [2025-03-08 15:42:58,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:58,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:42:58,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:42:58,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:58,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:42:58,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:58,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035443656] [2025-03-08 15:42:58,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035443656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:58,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:58,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870434386] [2025-03-08 15:42:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:58,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:58,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:58,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:58,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:58,844 INFO L87 Difference]: Start difference. First operand 306 states and 495 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:42:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:58,952 INFO L93 Difference]: Finished difference Result 911 states and 1477 transitions. [2025-03-08 15:42:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:58,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:42:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:58,958 INFO L225 Difference]: With dead ends: 911 [2025-03-08 15:42:58,958 INFO L226 Difference]: Without dead ends: 608 [2025-03-08 15:42:58,959 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:42:58,960 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 455 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:58,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1341 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-08 15:42:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2025-03-08 15:42:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 432 states have (on average 1.4814814814814814) internal successors, (640), 432 states have internal predecessors, (640), 170 states have call successors, (170), 2 states have call predecessors, (170), 2 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-08 15:42:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 980 transitions. [2025-03-08 15:42:59,050 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 980 transitions. Word has length 563 [2025-03-08 15:42:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:59,054 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 980 transitions. [2025-03-08 15:42:59,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:42:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 980 transitions. [2025-03-08 15:42:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:42:59,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:59,066 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:42:59,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:59,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash 259895875, now seen corresponding path program 1 times [2025-03-08 15:42:59,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:59,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124237661] [2025-03-08 15:42:59,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:59,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:42:59,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:42:59,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:59,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:42:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:42:59,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:42:59,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124237661] [2025-03-08 15:42:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124237661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:42:59,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:42:59,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:42:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019314967] [2025-03-08 15:42:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:42:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:42:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:42:59,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:42:59,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:42:59,367 INFO L87 Difference]: Start difference. First operand 605 states and 980 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:42:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:42:59,513 INFO L93 Difference]: Finished difference Result 1528 states and 2465 transitions. [2025-03-08 15:42:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:42:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:42:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:42:59,520 INFO L225 Difference]: With dead ends: 1528 [2025-03-08 15:42:59,520 INFO L226 Difference]: Without dead ends: 926 [2025-03-08 15:42:59,522 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:42:59,523 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 207 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:42:59,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 928 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:42:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-08 15:42:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 922. [2025-03-08 15:42:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 705 states have (on average 1.49645390070922) internal successors, (1055), 707 states have internal predecessors, (1055), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 210 states have call predecessors, (212), 212 states have call successors, (212) [2025-03-08 15:42:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1479 transitions. [2025-03-08 15:42:59,645 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1479 transitions. Word has length 563 [2025-03-08 15:42:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:42:59,646 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1479 transitions. [2025-03-08 15:42:59,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:42:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1479 transitions. [2025-03-08 15:42:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:42:59,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:42:59,653 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:42:59,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:42:59,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:42:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1613205572, now seen corresponding path program 1 times [2025-03-08 15:42:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:42:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345813202] [2025-03-08 15:42:59,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:42:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:42:59,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:42:59,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:42:59,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:42:59,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345813202] [2025-03-08 15:43:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345813202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:00,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:00,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:00,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682541890] [2025-03-08 15:43:00,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:00,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:00,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:00,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:00,232 INFO L87 Difference]: Start difference. First operand 922 states and 1479 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:00,299 INFO L93 Difference]: Finished difference Result 1845 states and 2963 transitions. [2025-03-08 15:43:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:43:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:00,309 INFO L225 Difference]: With dead ends: 1845 [2025-03-08 15:43:00,309 INFO L226 Difference]: Without dead ends: 926 [2025-03-08 15:43:00,312 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:43:00,314 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:00,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 959 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:43:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-08 15:43:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2025-03-08 15:43:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 709 states have (on average 1.4936530324400563) internal successors, (1059), 711 states have internal predecessors, (1059), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 210 states have call predecessors, (212), 212 states have call successors, (212) [2025-03-08 15:43:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1483 transitions. [2025-03-08 15:43:00,396 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1483 transitions. Word has length 563 [2025-03-08 15:43:00,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:00,397 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 1483 transitions. [2025-03-08 15:43:00,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1483 transitions. [2025-03-08 15:43:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:43:00,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:00,404 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:00,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:43:00,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:00,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1712180701, now seen corresponding path program 1 times [2025-03-08 15:43:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:00,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056276346] [2025-03-08 15:43:00,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:00,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:43:00,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:43:00,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:00,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:01,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:01,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056276346] [2025-03-08 15:43:01,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056276346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:01,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:01,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:01,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886954029] [2025-03-08 15:43:01,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:01,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:01,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:01,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:01,092 INFO L87 Difference]: Start difference. First operand 926 states and 1483 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:01,247 INFO L93 Difference]: Finished difference Result 2393 states and 3812 transitions. [2025-03-08 15:43:01,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:01,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:43:01,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:01,254 INFO L225 Difference]: With dead ends: 2393 [2025-03-08 15:43:01,255 INFO L226 Difference]: Without dead ends: 1470 [2025-03-08 15:43:01,257 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:43:01,257 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 201 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:01,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 900 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2025-03-08 15:43:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1464. [2025-03-08 15:43:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1227 states have (on average 1.52159739201304) internal successors, (1867), 1233 states have internal predecessors, (1867), 228 states have call successors, (228), 8 states have call predecessors, (228), 8 states have return successors, (228), 222 states have call predecessors, (228), 228 states have call successors, (228) [2025-03-08 15:43:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2323 transitions. [2025-03-08 15:43:01,322 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2323 transitions. Word has length 563 [2025-03-08 15:43:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:01,323 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 2323 transitions. [2025-03-08 15:43:01,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2323 transitions. [2025-03-08 15:43:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:43:01,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:01,327 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:01,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:43:01,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:01,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1558092674, now seen corresponding path program 1 times [2025-03-08 15:43:01,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:01,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376917856] [2025-03-08 15:43:01,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:01,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:01,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:43:01,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:43:01,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:01,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376917856] [2025-03-08 15:43:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376917856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:43:02,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134675037] [2025-03-08 15:43:02,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:02,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:43:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:02,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:43:02,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:43:02,539 INFO L87 Difference]: Start difference. First operand 1464 states and 2323 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:03,341 INFO L93 Difference]: Finished difference Result 6684 states and 10720 transitions. [2025-03-08 15:43:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:43:03,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:43:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:03,365 INFO L225 Difference]: With dead ends: 6684 [2025-03-08 15:43:03,366 INFO L226 Difference]: Without dead ends: 5223 [2025-03-08 15:43:03,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:43:03,372 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 891 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 2973 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:03,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 2973 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:43:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2025-03-08 15:43:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 2927. [2025-03-08 15:43:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2454 states have (on average 1.5150774246128769) internal successors, (3718), 2466 states have internal predecessors, (3718), 456 states have call successors, (456), 16 states have call predecessors, (456), 16 states have return successors, (456), 444 states have call predecessors, (456), 456 states have call successors, (456) [2025-03-08 15:43:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 4630 transitions. [2025-03-08 15:43:03,582 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 4630 transitions. Word has length 563 [2025-03-08 15:43:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:03,582 INFO L471 AbstractCegarLoop]: Abstraction has 2927 states and 4630 transitions. [2025-03-08 15:43:03,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:03,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 4630 transitions. [2025-03-08 15:43:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:43:03,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:03,589 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:03,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:43:03,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1311779587, now seen corresponding path program 1 times [2025-03-08 15:43:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:03,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201691840] [2025-03-08 15:43:03,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:03,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:43:04,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:43:04,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:04,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201691840] [2025-03-08 15:43:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201691840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:04,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051075379] [2025-03-08 15:43:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:04,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:04,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:04,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:04,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:04,805 INFO L87 Difference]: Start difference. First operand 2927 states and 4630 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:05,165 INFO L93 Difference]: Finished difference Result 9277 states and 14605 transitions. [2025-03-08 15:43:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:05,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:43:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:05,195 INFO L225 Difference]: With dead ends: 9277 [2025-03-08 15:43:05,195 INFO L226 Difference]: Without dead ends: 6353 [2025-03-08 15:43:05,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:43:05,205 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 994 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:05,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1380 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:43:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2025-03-08 15:43:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 5457. [2025-03-08 15:43:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5457 states, 4824 states have (on average 1.5315091210613598) internal successors, (7388), 4852 states have internal predecessors, (7388), 600 states have call successors, (600), 32 states have call predecessors, (600), 32 states have return successors, (600), 572 states have call predecessors, (600), 600 states have call successors, (600) [2025-03-08 15:43:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 8588 transitions. [2025-03-08 15:43:05,427 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 8588 transitions. Word has length 563 [2025-03-08 15:43:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:05,428 INFO L471 AbstractCegarLoop]: Abstraction has 5457 states and 8588 transitions. [2025-03-08 15:43:05,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 8588 transitions. [2025-03-08 15:43:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:43:05,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:05,437 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:43:05,438 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:05,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:05,438 INFO L85 PathProgramCache]: Analyzing trace with hash 863082948, now seen corresponding path program 1 times [2025-03-08 15:43:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:05,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278959576] [2025-03-08 15:43:05,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:05,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:05,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:43:05,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:43:05,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:05,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:06,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278959576] [2025-03-08 15:43:06,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278959576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:06,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:06,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:06,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493367810] [2025-03-08 15:43:06,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:06,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:06,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:06,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:06,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:06,075 INFO L87 Difference]: Start difference. First operand 5457 states and 8588 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:06,616 INFO L93 Difference]: Finished difference Result 14373 states and 22560 transitions. [2025-03-08 15:43:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:06,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:43:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:06,655 INFO L225 Difference]: With dead ends: 14373 [2025-03-08 15:43:06,655 INFO L226 Difference]: Without dead ends: 8351 [2025-03-08 15:43:06,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:06,667 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 753 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:06,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 2228 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:43:06,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8351 states. [2025-03-08 15:43:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8351 to 5693. [2025-03-08 15:43:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5693 states, 5060 states have (on average 1.524110671936759) internal successors, (7712), 5088 states have internal predecessors, (7712), 600 states have call successors, (600), 32 states have call predecessors, (600), 32 states have return successors, (600), 572 states have call predecessors, (600), 600 states have call successors, (600) [2025-03-08 15:43:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5693 states to 5693 states and 8912 transitions. [2025-03-08 15:43:06,899 INFO L78 Accepts]: Start accepts. Automaton has 5693 states and 8912 transitions. Word has length 563 [2025-03-08 15:43:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:06,900 INFO L471 AbstractCegarLoop]: Abstraction has 5693 states and 8912 transitions. [2025-03-08 15:43:06,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5693 states and 8912 transitions. [2025-03-08 15:43:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:43:06,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:06,913 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:06,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:43:06,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:06,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2060734820, now seen corresponding path program 1 times [2025-03-08 15:43:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134791877] [2025-03-08 15:43:06,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:06,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:43:07,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:43:07,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:07,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:07,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134791877] [2025-03-08 15:43:07,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134791877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:07,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:07,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:43:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233734200] [2025-03-08 15:43:07,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:07,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:43:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:07,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:43:07,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:07,855 INFO L87 Difference]: Start difference. First operand 5693 states and 8912 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:08,218 INFO L93 Difference]: Finished difference Result 15253 states and 23794 transitions. [2025-03-08 15:43:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:43:08,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:43:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:08,258 INFO L225 Difference]: With dead ends: 15253 [2025-03-08 15:43:08,259 INFO L226 Difference]: Without dead ends: 9199 [2025-03-08 15:43:08,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:08,275 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 487 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:08,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1086 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:43:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9199 states. [2025-03-08 15:43:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9199 to 4349. [2025-03-08 15:43:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4349 states, 3868 states have (on average 1.5263702171664943) internal successors, (5904), 3880 states have internal predecessors, (5904), 456 states have call successors, (456), 24 states have call predecessors, (456), 24 states have return successors, (456), 444 states have call predecessors, (456), 456 states have call successors, (456) [2025-03-08 15:43:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4349 states to 4349 states and 6816 transitions. [2025-03-08 15:43:08,499 INFO L78 Accepts]: Start accepts. Automaton has 4349 states and 6816 transitions. Word has length 563 [2025-03-08 15:43:08,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:08,500 INFO L471 AbstractCegarLoop]: Abstraction has 4349 states and 6816 transitions. [2025-03-08 15:43:08,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4349 states and 6816 transitions. [2025-03-08 15:43:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 15:43:08,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:08,507 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:08,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:43:08,508 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:08,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1603773851, now seen corresponding path program 1 times [2025-03-08 15:43:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:08,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430037128] [2025-03-08 15:43:08,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:08,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 15:43:08,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 15:43:08,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:08,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:09,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430037128] [2025-03-08 15:43:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430037128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:09,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:09,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376501951] [2025-03-08 15:43:09,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:09,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:09,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:09,562 INFO L87 Difference]: Start difference. First operand 4349 states and 6816 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:10,299 INFO L93 Difference]: Finished difference Result 13761 states and 21585 transitions. [2025-03-08 15:43:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:10,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 563 [2025-03-08 15:43:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:10,327 INFO L225 Difference]: With dead ends: 13761 [2025-03-08 15:43:10,327 INFO L226 Difference]: Without dead ends: 9007 [2025-03-08 15:43:10,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:43:10,341 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 668 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:10,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1870 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:43:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9007 states. [2025-03-08 15:43:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9007 to 7503. [2025-03-08 15:43:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7503 states, 6558 states have (on average 1.5196706312900274) internal successors, (9966), 6586 states have internal predecessors, (9966), 896 states have call successors, (896), 48 states have call predecessors, (896), 48 states have return successors, (896), 868 states have call predecessors, (896), 896 states have call successors, (896) [2025-03-08 15:43:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7503 states to 7503 states and 11758 transitions. [2025-03-08 15:43:10,830 INFO L78 Accepts]: Start accepts. Automaton has 7503 states and 11758 transitions. Word has length 563 [2025-03-08 15:43:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:10,831 INFO L471 AbstractCegarLoop]: Abstraction has 7503 states and 11758 transitions. [2025-03-08 15:43:10,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7503 states and 11758 transitions. [2025-03-08 15:43:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2025-03-08 15:43:10,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:10,845 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:10,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:43:10,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:10,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1088209186, now seen corresponding path program 1 times [2025-03-08 15:43:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:10,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410297954] [2025-03-08 15:43:10,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:10,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-03-08 15:43:11,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-03-08 15:43:11,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:11,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:14,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:14,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410297954] [2025-03-08 15:43:14,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410297954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:14,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:14,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:43:14,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695766530] [2025-03-08 15:43:14,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:14,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:43:14,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:14,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:43:14,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:43:14,655 INFO L87 Difference]: Start difference. First operand 7503 states and 11758 transitions. Second operand has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-08 15:43:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:19,643 INFO L93 Difference]: Finished difference Result 32273 states and 50576 transitions. [2025-03-08 15:43:19,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 15:43:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) Word has length 564 [2025-03-08 15:43:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:19,720 INFO L225 Difference]: With dead ends: 32273 [2025-03-08 15:43:19,720 INFO L226 Difference]: Without dead ends: 28528 [2025-03-08 15:43:19,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 15:43:19,731 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 6256 mSDsluCounter, 3810 mSDsCounter, 0 mSdLazyCounter, 3569 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6256 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 4006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 3569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:19,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6256 Valid, 4253 Invalid, 4006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 3569 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 15:43:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28528 states. [2025-03-08 15:43:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28528 to 8841. [2025-03-08 15:43:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8841 states, 7741 states have (on average 1.5190543857382768) internal successors, (11759), 7773 states have internal predecessors, (11759), 1037 states have call successors, (1037), 62 states have call predecessors, (1037), 62 states have return successors, (1037), 1005 states have call predecessors, (1037), 1037 states have call successors, (1037) [2025-03-08 15:43:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 13833 transitions. [2025-03-08 15:43:20,305 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 13833 transitions. Word has length 564 [2025-03-08 15:43:20,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:20,306 INFO L471 AbstractCegarLoop]: Abstraction has 8841 states and 13833 transitions. [2025-03-08 15:43:20,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.466666666666667) internal successors, (142), 15 states have internal predecessors, (142), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-08 15:43:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 13833 transitions. [2025-03-08 15:43:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2025-03-08 15:43:20,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:20,323 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:20,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:43:20,324 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:20,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2057790209, now seen corresponding path program 1 times [2025-03-08 15:43:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:20,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662495728] [2025-03-08 15:43:20,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:20,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:20,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-03-08 15:43:21,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-03-08 15:43:21,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:21,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:23,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:23,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662495728] [2025-03-08 15:43:23,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662495728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:23,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:23,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 15:43:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056731590] [2025-03-08 15:43:23,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:23,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:43:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:23,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:43:23,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:43:23,100 INFO L87 Difference]: Start difference. First operand 8841 states and 13833 transitions. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2025-03-08 15:43:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:26,332 INFO L93 Difference]: Finished difference Result 31063 states and 47904 transitions. [2025-03-08 15:43:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:43:26,333 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) Word has length 564 [2025-03-08 15:43:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:26,387 INFO L225 Difference]: With dead ends: 31063 [2025-03-08 15:43:26,387 INFO L226 Difference]: Without dead ends: 23207 [2025-03-08 15:43:26,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:43:26,403 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 3575 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 2537 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3575 SdHoareTripleChecker+Valid, 4424 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:26,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3575 Valid, 4424 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2537 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 15:43:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23207 states. [2025-03-08 15:43:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23207 to 16699. [2025-03-08 15:43:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16699 states, 14655 states have (on average 1.5250085295121119) internal successors, (22349), 14715 states have internal predecessors, (22349), 1933 states have call successors, (1933), 110 states have call predecessors, (1933), 110 states have return successors, (1933), 1873 states have call predecessors, (1933), 1933 states have call successors, (1933) [2025-03-08 15:43:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16699 states to 16699 states and 26215 transitions. [2025-03-08 15:43:27,269 INFO L78 Accepts]: Start accepts. Automaton has 16699 states and 26215 transitions. Word has length 564 [2025-03-08 15:43:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:27,270 INFO L471 AbstractCegarLoop]: Abstraction has 16699 states and 26215 transitions. [2025-03-08 15:43:27,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2025-03-08 15:43:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 16699 states and 26215 transitions. [2025-03-08 15:43:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2025-03-08 15:43:27,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:27,285 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:43:27,286 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:27,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1544075390, now seen corresponding path program 1 times [2025-03-08 15:43:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431040944] [2025-03-08 15:43:27,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:27,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-03-08 15:43:29,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-03-08 15:43:29,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:29,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:43:35,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:35,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431040944] [2025-03-08 15:43:35,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431040944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:35,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:35,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495238844] [2025-03-08 15:43:35,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:35,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:35,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:35,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:35,134 INFO L87 Difference]: Start difference. First operand 16699 states and 26215 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:36,300 INFO L93 Difference]: Finished difference Result 38415 states and 59389 transitions. [2025-03-08 15:43:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:36,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 564 [2025-03-08 15:43:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:36,353 INFO L225 Difference]: With dead ends: 38415 [2025-03-08 15:43:36,353 INFO L226 Difference]: Without dead ends: 22773 [2025-03-08 15:43:36,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:43:36,379 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 293 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:36,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1700 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:43:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22773 states. [2025-03-08 15:43:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22773 to 19011. [2025-03-08 15:43:37,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19011 states, 16899 states have (on average 1.5241730279898218) internal successors, (25757), 16959 states have internal predecessors, (25757), 1933 states have call successors, (1933), 178 states have call predecessors, (1933), 178 states have return successors, (1933), 1873 states have call predecessors, (1933), 1933 states have call successors, (1933) [2025-03-08 15:43:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19011 states to 19011 states and 29623 transitions. [2025-03-08 15:43:37,337 INFO L78 Accepts]: Start accepts. Automaton has 19011 states and 29623 transitions. Word has length 564 [2025-03-08 15:43:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:37,338 INFO L471 AbstractCegarLoop]: Abstraction has 19011 states and 29623 transitions. [2025-03-08 15:43:37,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:43:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 19011 states and 29623 transitions. [2025-03-08 15:43:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2025-03-08 15:43:37,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:37,353 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:37,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:43:37,353 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1211685088, now seen corresponding path program 1 times [2025-03-08 15:43:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:37,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848860463] [2025-03-08 15:43:37,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:37,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 564 statements into 1 equivalence classes. [2025-03-08 15:43:38,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 564 of 564 statements. [2025-03-08 15:43:38,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:38,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-08 15:44:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848860463] [2025-03-08 15:44:03,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848860463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:03,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260058100] [2025-03-08 15:44:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:03,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:03,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:03,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:03,996 INFO L87 Difference]: Start difference. First operand 19011 states and 29623 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:44:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:04,905 INFO L93 Difference]: Finished difference Result 40035 states and 61857 transitions. [2025-03-08 15:44:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:04,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 564 [2025-03-08 15:44:04,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:04,961 INFO L225 Difference]: With dead ends: 40035 [2025-03-08 15:44:04,961 INFO L226 Difference]: Without dead ends: 22297 [2025-03-08 15:44:04,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:04,989 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 284 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:04,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1544 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:44:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22297 states. [2025-03-08 15:44:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22297 to 16971. [2025-03-08 15:44:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16971 states, 14859 states have (on average 1.5129551113803081) internal successors, (22481), 14919 states have internal predecessors, (22481), 1933 states have call successors, (1933), 178 states have call predecessors, (1933), 178 states have return successors, (1933), 1873 states have call predecessors, (1933), 1933 states have call successors, (1933) [2025-03-08 15:44:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16971 states to 16971 states and 26347 transitions. [2025-03-08 15:44:05,876 INFO L78 Accepts]: Start accepts. Automaton has 16971 states and 26347 transitions. Word has length 564 [2025-03-08 15:44:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:05,877 INFO L471 AbstractCegarLoop]: Abstraction has 16971 states and 26347 transitions. [2025-03-08 15:44:05,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-08 15:44:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16971 states and 26347 transitions. [2025-03-08 15:44:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-08 15:44:05,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:05,889 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:05,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:44:05,889 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:05,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1739682016, now seen corresponding path program 1 times [2025-03-08 15:44:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662272533] [2025-03-08 15:44:05,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:05,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-08 15:44:07,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-08 15:44:07,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:07,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat