./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.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-61.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 bad025599360e4a40c7e5eb7ae8774b458dde60117017db7c90fc21953b8de16 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:45:57,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:45:57,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:45:57,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:45:57,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:45:57,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:45:57,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:45:57,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:45:57,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:45:57,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:45:57,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:45:57,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:45:57,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:45:57,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:45:57,731 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:45:57,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:45:57,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:45:57,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:45:57,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:45:57,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:45:57,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:45:57,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:45:57,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:45:57,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:45:57,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:45:57,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:45:57,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:45:57,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:45:57,732 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:45:57,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:57,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:45:57,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:45:57,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:45:57,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:45:57,734 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 -> bad025599360e4a40c7e5eb7ae8774b458dde60117017db7c90fc21953b8de16 [2025-03-08 15:45:57,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:45:57,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:45:57,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:45:57,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:45:57,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:45:57,986 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-61.i [2025-03-08 15:45:59,188 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fa8a1bb/824c71f020eb45bcbae27c1ce3956807/FLAGeb01c3fa9 [2025-03-08 15:45:59,486 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:45:59,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.i [2025-03-08 15:45:59,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fa8a1bb/824c71f020eb45bcbae27c1ce3956807/FLAGeb01c3fa9 [2025-03-08 15:45:59,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fa8a1bb/824c71f020eb45bcbae27c1ce3956807 [2025-03-08 15:45:59,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:45:59,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:45:59,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:59,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:45:59,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:45:59,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:45:59,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb20d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59, skipping insertion in model container [2025-03-08 15:45:59,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:45:59,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:45:59,684 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-61.i[916,929] [2025-03-08 15:45:59,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:59,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:45:59,828 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-61.i[916,929] [2025-03-08 15:45:59,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:59,931 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:45:59,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59 WrapperNode [2025-03-08 15:45:59,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:59,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:59,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:45:59,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:45:59,937 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:45:59" (1/1) ... [2025-03-08 15:45:59,958 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:45:59" (1/1) ... [2025-03-08 15:46:00,017 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 721 [2025-03-08 15:46:00,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:46:00,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:46:00,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:46:00,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:46:00,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,107 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:46:00,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:46:00,163 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:46:00,163 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:46:00,163 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:46:00,164 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (1/1) ... [2025-03-08 15:46:00,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:46:00,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:00,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:46:00,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:46:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:46:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:46:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:46:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:46:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:46:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:46:00,323 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:46:00,325 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:46:01,166 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L649: havoc property_#t~bitwise48#1;havoc property_#t~short49#1;havoc property_#t~ite52#1;havoc property_#t~ite51#1;havoc property_#t~bitwise50#1;havoc property_#t~short53#1;havoc property_#t~ite58#1;havoc property_#t~ite57#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~bitwise54#1;havoc property_#t~short59#1;havoc property_#t~ite63#1;havoc property_#t~ite62#1;havoc property_#t~bitwise60#1;havoc property_#t~bitwise61#1;havoc property_#t~short64#1; [2025-03-08 15:46:01,317 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2025-03-08 15:46:01,317 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:46:01,344 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:46:01,344 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:46:01,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:46:01 BoogieIcfgContainer [2025-03-08 15:46:01,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:46:01,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:46:01,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:46:01,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:46:01,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:45:59" (1/3) ... [2025-03-08 15:46:01,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e27dbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:46:01, skipping insertion in model container [2025-03-08 15:46:01,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:59" (2/3) ... [2025-03-08 15:46:01,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e27dbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:46:01, skipping insertion in model container [2025-03-08 15:46:01,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:46:01" (3/3) ... [2025-03-08 15:46:01,354 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-61.i [2025-03-08 15:46:01,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:46:01,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-61.i that has 2 procedures, 288 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:46:01,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:46:01,434 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;@29d1e113, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:46:01,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:46:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 288 states, 219 states have (on average 1.5570776255707763) internal successors, (341), 220 states have internal predecessors, (341), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:46:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:46:01,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:01,464 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:01,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:01,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1969490427, now seen corresponding path program 1 times [2025-03-08 15:46:01,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392101763] [2025-03-08 15:46:01,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:01,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:01,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:46:01,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:46:01,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:01,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-08 15:46:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392101763] [2025-03-08 15:46:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392101763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001328832] [2025-03-08 15:46:02,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:02,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:02,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:02,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:46:02,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:46:02,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:46:02,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:46:02,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:02,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:02,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:46:02,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-08 15:46:02,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:46:02,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001328832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:02,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:46:02,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:46:02,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812333999] [2025-03-08 15:46:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:02,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:46:02,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:02,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:46:02,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:46:02,460 INFO L87 Difference]: Start difference. First operand has 288 states, 219 states have (on average 1.5570776255707763) internal successors, (341), 220 states have internal predecessors, (341), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:46:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:02,522 INFO L93 Difference]: Finished difference Result 570 states and 1007 transitions. [2025-03-08 15:46:02,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:46:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 459 [2025-03-08 15:46:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:02,535 INFO L225 Difference]: With dead ends: 570 [2025-03-08 15:46:02,536 INFO L226 Difference]: Without dead ends: 285 [2025-03-08 15:46:02,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:46:02,545 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:02,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 458 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:46:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-08 15:46:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-08 15:46:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 217 states have (on average 1.5483870967741935) internal successors, (336), 217 states have internal predecessors, (336), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:46:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 468 transitions. [2025-03-08 15:46:02,610 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 468 transitions. Word has length 459 [2025-03-08 15:46:02,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:02,611 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 468 transitions. [2025-03-08 15:46:02,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:46:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 468 transitions. [2025-03-08 15:46:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:46:02,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:02,624 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:02,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:46:02,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:46:02,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1107885251, now seen corresponding path program 1 times [2025-03-08 15:46:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511555131] [2025-03-08 15:46:02,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:02,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:02,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:46:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:46:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:03,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511555131] [2025-03-08 15:46:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511555131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:03,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:03,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:03,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754605859] [2025-03-08 15:46:03,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:03,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:03,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:03,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:03,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:03,308 INFO L87 Difference]: Start difference. First operand 285 states and 468 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:03,427 INFO L93 Difference]: Finished difference Result 837 states and 1378 transitions. [2025-03-08 15:46:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:03,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459 [2025-03-08 15:46:03,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:03,434 INFO L225 Difference]: With dead ends: 837 [2025-03-08 15:46:03,436 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 15:46:03,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:03,438 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 459 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:03,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 876 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 15:46:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 394. [2025-03-08 15:46:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 326 states have (on average 1.607361963190184) internal successors, (524), 326 states have internal predecessors, (524), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 15:46:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 656 transitions. [2025-03-08 15:46:03,481 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 656 transitions. Word has length 459 [2025-03-08 15:46:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:03,484 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 656 transitions. [2025-03-08 15:46:03,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 656 transitions. [2025-03-08 15:46:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:46:03,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:03,491 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:03,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:46:03,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:03,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1316583554, now seen corresponding path program 1 times [2025-03-08 15:46:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437208593] [2025-03-08 15:46:03,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:03,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:46:03,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:46:03,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:03,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:04,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437208593] [2025-03-08 15:46:04,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437208593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:04,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:04,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336506670] [2025-03-08 15:46:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:04,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:04,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:04,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:04,161 INFO L87 Difference]: Start difference. First operand 394 states and 656 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:04,387 INFO L93 Difference]: Finished difference Result 1074 states and 1793 transitions. [2025-03-08 15:46:04,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:04,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459 [2025-03-08 15:46:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:04,394 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 15:46:04,396 INFO L226 Difference]: Without dead ends: 683 [2025-03-08 15:46:04,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:04,397 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 292 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:04,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 817 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:46:04,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-08 15:46:04,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2025-03-08 15:46:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 593 states have (on average 1.6323777403035413) internal successors, (968), 594 states have internal predecessors, (968), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 15:46:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1136 transitions. [2025-03-08 15:46:04,442 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1136 transitions. Word has length 459 [2025-03-08 15:46:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:04,443 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1136 transitions. [2025-03-08 15:46:04,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1136 transitions. [2025-03-08 15:46:04,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:46:04,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:04,452 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:04,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:46:04,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:04,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash -12189825, now seen corresponding path program 1 times [2025-03-08 15:46:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:04,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342590350] [2025-03-08 15:46:04,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:04,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:04,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:46:04,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:46:04,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:04,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:04,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:04,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342590350] [2025-03-08 15:46:04,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342590350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:04,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:04,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948728985] [2025-03-08 15:46:04,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:04,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:04,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:04,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:04,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:04,909 INFO L87 Difference]: Start difference. First operand 680 states and 1136 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:04,996 INFO L93 Difference]: Finished difference Result 2034 states and 3402 transitions. [2025-03-08 15:46:04,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:04,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459 [2025-03-08 15:46:04,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:05,007 INFO L225 Difference]: With dead ends: 2034 [2025-03-08 15:46:05,007 INFO L226 Difference]: Without dead ends: 1357 [2025-03-08 15:46:05,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:05,009 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 314 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:05,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1062 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:46:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-03-08 15:46:05,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1355. [2025-03-08 15:46:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1182 states have (on average 1.6311336717428089) internal successors, (1928), 1184 states have internal predecessors, (1928), 168 states have call successors, (168), 4 states have call predecessors, (168), 4 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-08 15:46:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2264 transitions. [2025-03-08 15:46:05,105 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2264 transitions. Word has length 459 [2025-03-08 15:46:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:05,107 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2264 transitions. [2025-03-08 15:46:05,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2264 transitions. [2025-03-08 15:46:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:05,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:05,114 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:05,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:46:05,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash -387579318, now seen corresponding path program 1 times [2025-03-08 15:46:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839232158] [2025-03-08 15:46:05,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:05,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:05,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:05,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:05,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:05,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:05,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839232158] [2025-03-08 15:46:05,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839232158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:05,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:05,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:46:05,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618709911] [2025-03-08 15:46:05,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:05,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:46:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:05,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:46:05,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:05,834 INFO L87 Difference]: Start difference. First operand 1355 states and 2264 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:05,982 INFO L93 Difference]: Finished difference Result 4059 states and 6786 transitions. [2025-03-08 15:46:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:46:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2025-03-08 15:46:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:05,995 INFO L225 Difference]: With dead ends: 4059 [2025-03-08 15:46:05,995 INFO L226 Difference]: Without dead ends: 2707 [2025-03-08 15:46:05,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:46:06,000 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 345 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:06,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 893 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2707 states. [2025-03-08 15:46:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2707 to 2705. [2025-03-08 15:46:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2360 states have (on average 1.6271186440677967) internal successors, (3840), 2364 states have internal predecessors, (3840), 336 states have call successors, (336), 8 states have call predecessors, (336), 8 states have return successors, (336), 332 states have call predecessors, (336), 336 states have call successors, (336) [2025-03-08 15:46:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 4512 transitions. [2025-03-08 15:46:06,145 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 4512 transitions. Word has length 460 [2025-03-08 15:46:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:06,146 INFO L471 AbstractCegarLoop]: Abstraction has 2705 states and 4512 transitions. [2025-03-08 15:46:06,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 4512 transitions. [2025-03-08 15:46:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:06,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:06,153 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:06,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:46:06,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:06,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:06,154 INFO L85 PathProgramCache]: Analyzing trace with hash -374046517, now seen corresponding path program 1 times [2025-03-08 15:46:06,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:06,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175353630] [2025-03-08 15:46:06,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:06,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:06,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:06,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:06,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:07,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:07,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175353630] [2025-03-08 15:46:07,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175353630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:07,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:07,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:46:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79388271] [2025-03-08 15:46:07,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:07,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:46:07,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:07,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:46:07,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:46:07,646 INFO L87 Difference]: Start difference. First operand 2705 states and 4512 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:07,984 INFO L93 Difference]: Finished difference Result 6643 states and 10859 transitions. [2025-03-08 15:46:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:46:07,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2025-03-08 15:46:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:08,002 INFO L225 Difference]: With dead ends: 6643 [2025-03-08 15:46:08,003 INFO L226 Difference]: Without dead ends: 3941 [2025-03-08 15:46:08,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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:46:08,009 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 817 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:08,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1373 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:46:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2025-03-08 15:46:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 2737. [2025-03-08 15:46:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2737 states, 2384 states have (on average 1.6140939597315436) internal successors, (3848), 2388 states have internal predecessors, (3848), 336 states have call successors, (336), 16 states have call predecessors, (336), 16 states have return successors, (336), 332 states have call predecessors, (336), 336 states have call successors, (336) [2025-03-08 15:46:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 4520 transitions. [2025-03-08 15:46:08,196 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 4520 transitions. Word has length 460 [2025-03-08 15:46:08,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:08,197 INFO L471 AbstractCegarLoop]: Abstraction has 2737 states and 4520 transitions. [2025-03-08 15:46:08,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 4520 transitions. [2025-03-08 15:46:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:08,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:08,207 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:08,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:46:08,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:08,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:08,208 INFO L85 PathProgramCache]: Analyzing trace with hash 651445482, now seen corresponding path program 1 times [2025-03-08 15:46:08,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:08,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397163569] [2025-03-08 15:46:08,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:08,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:08,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:08,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:08,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:08,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:08,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397163569] [2025-03-08 15:46:08,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397163569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:08,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:08,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:46:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560438736] [2025-03-08 15:46:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:08,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:46:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:08,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:46:08,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:46:08,893 INFO L87 Difference]: Start difference. First operand 2737 states and 4520 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:46:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:09,862 INFO L93 Difference]: Finished difference Result 12513 states and 20676 transitions. [2025-03-08 15:46:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:46:09,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 460 [2025-03-08 15:46:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:09,900 INFO L225 Difference]: With dead ends: 12513 [2025-03-08 15:46:09,900 INFO L226 Difference]: Without dead ends: 9779 [2025-03-08 15:46:09,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:46:09,911 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 2201 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:09,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2201 Valid, 1454 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:46:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9779 states. [2025-03-08 15:46:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 3337. [2025-03-08 15:46:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 2976 states have (on average 1.6155913978494623) internal successors, (4808), 2980 states have internal predecessors, (4808), 336 states have call successors, (336), 24 states have call predecessors, (336), 24 states have return successors, (336), 332 states have call predecessors, (336), 336 states have call successors, (336) [2025-03-08 15:46:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5480 transitions. [2025-03-08 15:46:10,156 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5480 transitions. Word has length 460 [2025-03-08 15:46:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:10,157 INFO L471 AbstractCegarLoop]: Abstraction has 3337 states and 5480 transitions. [2025-03-08 15:46:10,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:46:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5480 transitions. [2025-03-08 15:46:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:10,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:10,163 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:10,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:46:10,164 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:10,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1621026505, now seen corresponding path program 1 times [2025-03-08 15:46:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:10,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50991514] [2025-03-08 15:46:10,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:10,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:10,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:10,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:10,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:10,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:11,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:11,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50991514] [2025-03-08 15:46:11,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50991514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:11,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:11,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513764470] [2025-03-08 15:46:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:11,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:11,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:11,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:11,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:11,068 INFO L87 Difference]: Start difference. First operand 3337 states and 5480 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:11,303 INFO L93 Difference]: Finished difference Result 11731 states and 19359 transitions. [2025-03-08 15:46:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:11,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2025-03-08 15:46:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:11,338 INFO L225 Difference]: With dead ends: 11731 [2025-03-08 15:46:11,339 INFO L226 Difference]: Without dead ends: 8397 [2025-03-08 15:46:11,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:11,350 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 489 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:11,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1351 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:46:11,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8397 states. [2025-03-08 15:46:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8397 to 7169. [2025-03-08 15:46:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7169 states, 6784 states have (on average 1.6367924528301887) internal successors, (11104), 6796 states have internal predecessors, (11104), 352 states have call successors, (352), 32 states have call predecessors, (352), 32 states have return successors, (352), 340 states have call predecessors, (352), 352 states have call successors, (352) [2025-03-08 15:46:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 11808 transitions. [2025-03-08 15:46:11,582 INFO L78 Accepts]: Start accepts. Automaton has 7169 states and 11808 transitions. Word has length 460 [2025-03-08 15:46:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:11,583 INFO L471 AbstractCegarLoop]: Abstraction has 7169 states and 11808 transitions. [2025-03-08 15:46:11,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7169 states and 11808 transitions. [2025-03-08 15:46:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:11,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:11,600 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:11,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:46:11,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:11,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1474728279, now seen corresponding path program 1 times [2025-03-08 15:46:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:11,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850452481] [2025-03-08 15:46:11,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:11,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:11,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:11,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:11,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850452481] [2025-03-08 15:46:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850452481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:46:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151663811] [2025-03-08 15:46:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:12,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:46:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:12,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:46:12,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:46:12,373 INFO L87 Difference]: Start difference. First operand 7169 states and 11808 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:46:17,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:46:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:18,246 INFO L93 Difference]: Finished difference Result 24557 states and 40026 transitions. [2025-03-08 15:46:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:46:18,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 460 [2025-03-08 15:46:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:18,295 INFO L225 Difference]: With dead ends: 24557 [2025-03-08 15:46:18,295 INFO L226 Difference]: Without dead ends: 17391 [2025-03-08 15:46:18,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:46:18,317 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1608 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 208 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:18,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 1853 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1124 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-03-08 15:46:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17391 states. [2025-03-08 15:46:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17391 to 12533. [2025-03-08 15:46:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12533 states, 11824 states have (on average 1.6224627875507442) internal successors, (19184), 11860 states have internal predecessors, (19184), 624 states have call successors, (624), 84 states have call predecessors, (624), 84 states have return successors, (624), 588 states have call predecessors, (624), 624 states have call successors, (624) [2025-03-08 15:46:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 20432 transitions. [2025-03-08 15:46:18,755 INFO L78 Accepts]: Start accepts. Automaton has 12533 states and 20432 transitions. Word has length 460 [2025-03-08 15:46:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:18,756 INFO L471 AbstractCegarLoop]: Abstraction has 12533 states and 20432 transitions. [2025-03-08 15:46:18,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 15:46:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 12533 states and 20432 transitions. [2025-03-08 15:46:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:18,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:18,773 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:18,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:46:18,773 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:18,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1263377366, now seen corresponding path program 1 times [2025-03-08 15:46:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156164845] [2025-03-08 15:46:18,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:18,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:19,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:19,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:19,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:19,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:19,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156164845] [2025-03-08 15:46:19,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156164845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:19,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601743321] [2025-03-08 15:46:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:19,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:19,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:19,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:19,544 INFO L87 Difference]: Start difference. First operand 12533 states and 20432 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:20,295 INFO L93 Difference]: Finished difference Result 46803 states and 76163 transitions. [2025-03-08 15:46:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:20,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2025-03-08 15:46:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:20,375 INFO L225 Difference]: With dead ends: 46803 [2025-03-08 15:46:20,375 INFO L226 Difference]: Without dead ends: 34273 [2025-03-08 15:46:20,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:20,397 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 710 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:20,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1116 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:46:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34273 states. [2025-03-08 15:46:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34273 to 29433. [2025-03-08 15:46:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29433 states, 28216 states have (on average 1.620499007655231) internal successors, (45724), 28292 states have internal predecessors, (45724), 1048 states have call successors, (1048), 168 states have call predecessors, (1048), 168 states have return successors, (1048), 972 states have call predecessors, (1048), 1048 states have call successors, (1048) [2025-03-08 15:46:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29433 states to 29433 states and 47820 transitions. [2025-03-08 15:46:21,133 INFO L78 Accepts]: Start accepts. Automaton has 29433 states and 47820 transitions. Word has length 460 [2025-03-08 15:46:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:21,134 INFO L471 AbstractCegarLoop]: Abstraction has 29433 states and 47820 transitions. [2025-03-08 15:46:21,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 29433 states and 47820 transitions. [2025-03-08 15:46:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:46:21,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:21,168 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:46:21,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:46:21,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:21,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2034517577, now seen corresponding path program 1 times [2025-03-08 15:46:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144484575] [2025-03-08 15:46:21,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:21,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:46:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:46:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 15:46:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:22,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144484575] [2025-03-08 15:46:22,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144484575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:22,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:22,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:46:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830323750] [2025-03-08 15:46:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:22,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:46:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:22,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:46:22,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:46:22,755 INFO L87 Difference]: Start difference. First operand 29433 states and 47820 transitions. Second operand has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 15:46:28,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:46:32,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:46:36,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:46:40,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:46:44,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:46:48,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:46:52,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:46:56,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:47:00,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:47:04,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:47:08,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:47:12,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:47:16,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:47:20,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:47:24,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:47:28,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []