./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-95.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_fillercode_fillercodesize_ps-cn-500_file-95.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 e4d4716b5bcc1e4ce7ea9f8c28198c0117438c6f376763aaf88a2602c602b3db --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:24:13,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:24:13,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:24:13,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:24:13,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:24:13,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:24:13,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:24:13,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:24:13,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:24:13,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:24:13,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:24:13,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:24:13,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:24:13,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:24:13,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:24:13,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:24:13,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:24:13,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:24:13,693 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 -> e4d4716b5bcc1e4ce7ea9f8c28198c0117438c6f376763aaf88a2602c602b3db [2025-03-08 11:24:13,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:24:13,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:24:13,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:24:13,964 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:24:13,964 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:24:13,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-95.i [2025-03-08 11:24:15,085 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f3be80c/de41cc7a25914e6d88273534551393ab/FLAG49babcbcb [2025-03-08 11:24:15,368 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:24:15,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-95.i [2025-03-08 11:24:15,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f3be80c/de41cc7a25914e6d88273534551393ab/FLAG49babcbcb [2025-03-08 11:24:15,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5f3be80c/de41cc7a25914e6d88273534551393ab [2025-03-08 11:24:15,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:24:15,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:24:15,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:24:15,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:24:15,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:24:15,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:24:15" (1/1) ... [2025-03-08 11:24:15,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfc6d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:15, skipping insertion in model container [2025-03-08 11:24:15,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:24:15" (1/1) ... [2025-03-08 11:24:15,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:24:15,800 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-95.i[916,929] [2025-03-08 11:24:15,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:24:15,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:24:16,001 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-95.i[916,929] [2025-03-08 11:24:16,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:24:16,098 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:24:16,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16 WrapperNode [2025-03-08 11:24:16,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:24:16,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:24:16,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:24:16,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:24:16,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,221 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 769 [2025-03-08 11:24:16,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:24:16,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:24:16,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:24:16,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:24:16,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,282 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 11:24:16,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:24:16,340 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:24:16,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:24:16,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:24:16,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (1/1) ... [2025-03-08 11:24:16,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:24:16,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:24:16,368 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 11:24:16,370 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 11:24:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:24:16,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:24:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:24:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:24:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:24:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:24:16,493 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:24:16,495 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:24:17,275 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc property_#t~bitwise67#1;havoc property_#t~short68#1; [2025-03-08 11:24:17,440 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 11:24:17,440 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:24:17,468 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:24:17,472 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-08 11:24:17,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:24:17 BoogieIcfgContainer [2025-03-08 11:24:17,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:24:17,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:24:17,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:24:17,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:24:17,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:24:15" (1/3) ... [2025-03-08 11:24:17,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b5af61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:24:17, skipping insertion in model container [2025-03-08 11:24:17,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:16" (2/3) ... [2025-03-08 11:24:17,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b5af61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:24:17, skipping insertion in model container [2025-03-08 11:24:17,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:24:17" (3/3) ... [2025-03-08 11:24:17,482 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-95.i [2025-03-08 11:24:17,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:24:17,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-95.i that has 2 procedures, 315 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:24:17,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:24:17,564 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;@212c6dd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:24:17,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:24:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 315 states, 226 states have (on average 1.6371681415929205) internal successors, (370), 227 states have internal predecessors, (370), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 11:24:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-08 11:24:17,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:17,611 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:17,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:17,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1994840246, now seen corresponding path program 1 times [2025-03-08 11:24:17,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:17,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076922638] [2025-03-08 11:24:17,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:17,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-08 11:24:17,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-08 11:24:17,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:17,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-08 11:24:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076922638] [2025-03-08 11:24:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076922638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:24:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674903111] [2025-03-08 11:24:18,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:24:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:24:18,219 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 11:24:18,221 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 11:24:18,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-08 11:24:18,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-08 11:24:18,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:18,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:18,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:24:18,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:24:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-08 11:24:18,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:24:18,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674903111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:18,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:24:18,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:24:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270132166] [2025-03-08 11:24:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:18,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:24:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:18,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:24:18,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:24:18,658 INFO L87 Difference]: Start difference. First operand has 315 states, 226 states have (on average 1.6371681415929205) internal successors, (370), 227 states have internal predecessors, (370), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 11:24:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:18,742 INFO L93 Difference]: Finished difference Result 623 states and 1163 transitions. [2025-03-08 11:24:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:24:18,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 572 [2025-03-08 11:24:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:18,752 INFO L225 Difference]: With dead ends: 623 [2025-03-08 11:24:18,752 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 11:24:18,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 573 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 11:24:18,763 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:18,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:24:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 11:24:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2025-03-08 11:24:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 223 states have (on average 1.6053811659192825) internal successors, (358), 223 states have internal predecessors, (358), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 11:24:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 530 transitions. [2025-03-08 11:24:18,846 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 530 transitions. Word has length 572 [2025-03-08 11:24:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:18,848 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 530 transitions. [2025-03-08 11:24:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 11:24:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 530 transitions. [2025-03-08 11:24:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-08 11:24:18,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:18,860 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:18,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:24:19,061 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 11:24:19,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1225773556, now seen corresponding path program 1 times [2025-03-08 11:24:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970363308] [2025-03-08 11:24:19,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:19,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-08 11:24:19,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-08 11:24:19,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:19,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970363308] [2025-03-08 11:24:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970363308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:24:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778289693] [2025-03-08 11:24:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:19,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:24:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:19,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:24:19,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:24:19,821 INFO L87 Difference]: Start difference. First operand 311 states and 530 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:20,105 INFO L93 Difference]: Finished difference Result 1169 states and 2014 transitions. [2025-03-08 11:24:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:24:20,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 572 [2025-03-08 11:24:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:20,116 INFO L225 Difference]: With dead ends: 1169 [2025-03-08 11:24:20,117 INFO L226 Difference]: Without dead ends: 861 [2025-03-08 11:24:20,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:24:20,118 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 917 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:20,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2234 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:24:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-08 11:24:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 852. [2025-03-08 11:24:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 702 states have (on average 1.6723646723646723) internal successors, (1174), 705 states have internal predecessors, (1174), 145 states have call successors, (145), 4 states have call predecessors, (145), 4 states have return successors, (145), 142 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-08 11:24:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1464 transitions. [2025-03-08 11:24:20,185 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1464 transitions. Word has length 572 [2025-03-08 11:24:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:20,188 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1464 transitions. [2025-03-08 11:24:20,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1464 transitions. [2025-03-08 11:24:20,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-08 11:24:20,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:20,196 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:20,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:24:20,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:20,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash 264758294, now seen corresponding path program 1 times [2025-03-08 11:24:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:20,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666096791] [2025-03-08 11:24:20,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:20,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:20,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-08 11:24:20,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-08 11:24:20,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:20,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:20,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666096791] [2025-03-08 11:24:20,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666096791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:20,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:20,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290687258] [2025-03-08 11:24:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:20,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:20,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:20,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:20,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:20,500 INFO L87 Difference]: Start difference. First operand 852 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:20,602 INFO L93 Difference]: Finished difference Result 1732 states and 2977 transitions. [2025-03-08 11:24:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:20,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 573 [2025-03-08 11:24:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:20,614 INFO L225 Difference]: With dead ends: 1732 [2025-03-08 11:24:20,614 INFO L226 Difference]: Without dead ends: 883 [2025-03-08 11:24:20,616 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 11:24:20,616 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 308 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:20,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1027 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-08 11:24:20,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 683. [2025-03-08 11:24:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 578 states have (on average 1.6816608996539792) internal successors, (972), 579 states have internal predecessors, (972), 101 states have call successors, (101), 3 states have call predecessors, (101), 3 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-08 11:24:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1174 transitions. [2025-03-08 11:24:20,662 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1174 transitions. Word has length 573 [2025-03-08 11:24:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:20,663 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1174 transitions. [2025-03-08 11:24:20,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1174 transitions. [2025-03-08 11:24:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-08 11:24:20,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:20,672 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:20,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:24:20,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:20,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash -183938345, now seen corresponding path program 1 times [2025-03-08 11:24:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:20,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597464433] [2025-03-08 11:24:20,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:20,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-08 11:24:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-08 11:24:20,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:20,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:20,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597464433] [2025-03-08 11:24:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597464433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:20,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610567918] [2025-03-08 11:24:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:20,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:20,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:20,910 INFO L87 Difference]: Start difference. First operand 683 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:21,001 INFO L93 Difference]: Finished difference Result 1826 states and 3135 transitions. [2025-03-08 11:24:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:21,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 573 [2025-03-08 11:24:21,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:21,009 INFO L225 Difference]: With dead ends: 1826 [2025-03-08 11:24:21,010 INFO L226 Difference]: Without dead ends: 1146 [2025-03-08 11:24:21,011 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 11:24:21,013 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 301 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:21,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1166 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-08 11:24:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1127. [2025-03-08 11:24:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 954 states have (on average 1.6677148846960168) internal successors, (1591), 957 states have internal predecessors, (1591), 166 states have call successors, (166), 6 states have call predecessors, (166), 6 states have return successors, (166), 163 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-08 11:24:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1923 transitions. [2025-03-08 11:24:21,084 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1923 transitions. Word has length 573 [2025-03-08 11:24:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:21,085 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1923 transitions. [2025-03-08 11:24:21,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1923 transitions. [2025-03-08 11:24:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-08 11:24:21,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:21,090 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:24:21,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:21,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1060826136, now seen corresponding path program 1 times [2025-03-08 11:24:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031537486] [2025-03-08 11:24:21,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:21,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-08 11:24:21,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-08 11:24:21,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:21,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:21,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:21,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031537486] [2025-03-08 11:24:21,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031537486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:21,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:21,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:21,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869711602] [2025-03-08 11:24:21,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:21,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:21,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:21,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:21,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:21,307 INFO L87 Difference]: Start difference. First operand 1127 states and 1923 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:21,424 INFO L93 Difference]: Finished difference Result 3375 states and 5763 transitions. [2025-03-08 11:24:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:21,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 573 [2025-03-08 11:24:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:21,437 INFO L225 Difference]: With dead ends: 3375 [2025-03-08 11:24:21,437 INFO L226 Difference]: Without dead ends: 2251 [2025-03-08 11:24:21,441 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 11:24:21,441 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 518 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:21,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1082 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2025-03-08 11:24:21,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2249. [2025-03-08 11:24:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 1904 states have (on average 1.6596638655462186) internal successors, (3160), 1910 states have internal predecessors, (3160), 332 states have call successors, (332), 12 states have call predecessors, (332), 12 states have return successors, (332), 326 states have call predecessors, (332), 332 states have call successors, (332) [2025-03-08 11:24:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3824 transitions. [2025-03-08 11:24:21,564 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3824 transitions. Word has length 573 [2025-03-08 11:24:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:21,566 INFO L471 AbstractCegarLoop]: Abstraction has 2249 states and 3824 transitions. [2025-03-08 11:24:21,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3824 transitions. [2025-03-08 11:24:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-08 11:24:21,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:21,575 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:21,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:24:21,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:21,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash 849475223, now seen corresponding path program 1 times [2025-03-08 11:24:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:21,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971728955] [2025-03-08 11:24:21,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:21,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-08 11:24:21,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-08 11:24:21,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:21,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:21,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:21,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971728955] [2025-03-08 11:24:21,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971728955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:21,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:21,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:24:21,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776041279] [2025-03-08 11:24:21,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:21,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:24:21,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:21,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:24:21,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:24:21,933 INFO L87 Difference]: Start difference. First operand 2249 states and 3824 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 11:24:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:22,150 INFO L93 Difference]: Finished difference Result 6741 states and 11466 transitions. [2025-03-08 11:24:22,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:22,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 573 [2025-03-08 11:24:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:22,171 INFO L225 Difference]: With dead ends: 6741 [2025-03-08 11:24:22,171 INFO L226 Difference]: Without dead ends: 4495 [2025-03-08 11:24:22,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:24:22,177 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 482 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:22,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1502 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2025-03-08 11:24:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4493. [2025-03-08 11:24:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4493 states, 3804 states have (on average 1.6561514195583595) internal successors, (6300), 3816 states have internal predecessors, (6300), 664 states have call successors, (664), 24 states have call predecessors, (664), 24 states have return successors, (664), 652 states have call predecessors, (664), 664 states have call successors, (664) [2025-03-08 11:24:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 7628 transitions. [2025-03-08 11:24:22,376 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 7628 transitions. Word has length 573 [2025-03-08 11:24:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:22,377 INFO L471 AbstractCegarLoop]: Abstraction has 4493 states and 7628 transitions. [2025-03-08 11:24:22,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-08 11:24:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 7628 transitions. [2025-03-08 11:24:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-08 11:24:22,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:22,383 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:24:22,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1081143882, now seen corresponding path program 1 times [2025-03-08 11:24:22,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:22,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884613182] [2025-03-08 11:24:22,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:22,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-08 11:24:22,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-08 11:24:22,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:22,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:22,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:22,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884613182] [2025-03-08 11:24:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884613182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:22,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:22,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527677170] [2025-03-08 11:24:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:22,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:22,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:22,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:22,717 INFO L87 Difference]: Start difference. First operand 4493 states and 7628 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:22,990 INFO L93 Difference]: Finished difference Result 13341 states and 22670 transitions. [2025-03-08 11:24:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:22,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 573 [2025-03-08 11:24:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:23,027 INFO L225 Difference]: With dead ends: 13341 [2025-03-08 11:24:23,028 INFO L226 Difference]: Without dead ends: 8851 [2025-03-08 11:24:23,037 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 11:24:23,038 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 457 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:23,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1236 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:23,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8851 states. [2025-03-08 11:24:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8851 to 8845. [2025-03-08 11:24:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8845 states, 7468 states have (on average 1.6475629351901446) internal successors, (12304), 7492 states have internal predecessors, (12304), 1328 states have call successors, (1328), 48 states have call predecessors, (1328), 48 states have return successors, (1328), 1304 states have call predecessors, (1328), 1328 states have call successors, (1328) [2025-03-08 11:24:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8845 states to 8845 states and 14960 transitions. [2025-03-08 11:24:23,478 INFO L78 Accepts]: Start accepts. Automaton has 8845 states and 14960 transitions. Word has length 573 [2025-03-08 11:24:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:23,480 INFO L471 AbstractCegarLoop]: Abstraction has 8845 states and 14960 transitions. [2025-03-08 11:24:23,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 8845 states and 14960 transitions. [2025-03-08 11:24:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-08 11:24:23,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:23,498 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:23,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:24:23,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash 380436117, now seen corresponding path program 1 times [2025-03-08 11:24:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:23,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668135344] [2025-03-08 11:24:23,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:23,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-08 11:24:23,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-08 11:24:23,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:23,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:24,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668135344] [2025-03-08 11:24:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668135344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:24,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:24,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:24:24,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621679422] [2025-03-08 11:24:24,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:24,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:24:24,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:24,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:24:24,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:24:24,072 INFO L87 Difference]: Start difference. First operand 8845 states and 14960 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:25,434 INFO L93 Difference]: Finished difference Result 34675 states and 58639 transitions. [2025-03-08 11:24:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:24:25,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 573 [2025-03-08 11:24:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:25,543 INFO L225 Difference]: With dead ends: 34675 [2025-03-08 11:24:25,544 INFO L226 Difference]: Without dead ends: 25833 [2025-03-08 11:24:25,572 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 11:24:25,573 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 1132 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:25,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1474 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:24:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25833 states. [2025-03-08 11:24:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25833 to 11605. [2025-03-08 11:24:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11605 states, 10228 states have (on average 1.6761830269847477) internal successors, (17144), 10252 states have internal predecessors, (17144), 1328 states have call successors, (1328), 48 states have call predecessors, (1328), 48 states have return successors, (1328), 1304 states have call predecessors, (1328), 1328 states have call successors, (1328) [2025-03-08 11:24:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 19800 transitions. [2025-03-08 11:24:26,473 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 19800 transitions. Word has length 573 [2025-03-08 11:24:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 11605 states and 19800 transitions. [2025-03-08 11:24:26,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 19800 transitions. [2025-03-08 11:24:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-08 11:24:26,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:26,488 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:26,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:24:26,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:26,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:26,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1684829846, now seen corresponding path program 1 times [2025-03-08 11:24:26,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:26,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392703798] [2025-03-08 11:24:26,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:26,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-08 11:24:26,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-08 11:24:26,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:26,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:27,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392703798] [2025-03-08 11:24:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392703798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:24:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244110683] [2025-03-08 11:24:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:24:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:27,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:24:27,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:24:27,510 INFO L87 Difference]: Start difference. First operand 11605 states and 19800 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:28,493 INFO L93 Difference]: Finished difference Result 38303 states and 65491 transitions. [2025-03-08 11:24:28,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:24:28,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 573 [2025-03-08 11:24:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:28,559 INFO L225 Difference]: With dead ends: 38303 [2025-03-08 11:24:28,559 INFO L226 Difference]: Without dead ends: 26701 [2025-03-08 11:24:28,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:24:28,584 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 710 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 3710 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:28,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 3710 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:24:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26701 states. [2025-03-08 11:24:29,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26701 to 26672. [2025-03-08 11:24:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26672 states, 24433 states have (on average 1.6887406376621783) internal successors, (41261), 24506 states have internal predecessors, (41261), 2131 states have call successors, (2131), 107 states have call predecessors, (2131), 107 states have return successors, (2131), 2058 states have call predecessors, (2131), 2131 states have call successors, (2131) [2025-03-08 11:24:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26672 states to 26672 states and 45523 transitions. [2025-03-08 11:24:29,381 INFO L78 Accepts]: Start accepts. Automaton has 26672 states and 45523 transitions. Word has length 573 [2025-03-08 11:24:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:29,382 INFO L471 AbstractCegarLoop]: Abstraction has 26672 states and 45523 transitions. [2025-03-08 11:24:29,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26672 states and 45523 transitions. [2025-03-08 11:24:29,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-08 11:24:29,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:29,402 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:29,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:24:29,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:29,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:29,403 INFO L85 PathProgramCache]: Analyzing trace with hash -960000651, now seen corresponding path program 1 times [2025-03-08 11:24:29,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:29,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960823371] [2025-03-08 11:24:29,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:29,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:29,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-08 11:24:29,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-08 11:24:29,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:29,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:30,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960823371] [2025-03-08 11:24:30,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960823371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:30,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:24:30,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851117207] [2025-03-08 11:24:30,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:24:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:30,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:24:30,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:24:30,027 INFO L87 Difference]: Start difference. First operand 26672 states and 45523 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:34,377 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 11:24:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:36,658 INFO L93 Difference]: Finished difference Result 83727 states and 142373 transitions. [2025-03-08 11:24:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:24:36,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 573 [2025-03-08 11:24:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:36,812 INFO L225 Difference]: With dead ends: 83727 [2025-03-08 11:24:36,813 INFO L226 Difference]: Without dead ends: 57101 [2025-03-08 11:24:36,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:24:36,866 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 1741 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 95 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:36,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 2655 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 558 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 11:24:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57101 states. [2025-03-08 11:24:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57101 to 47856. [2025-03-08 11:24:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47856 states, 43585 states have (on average 1.670230583916485) internal successors, (72797), 43770 states have internal predecessors, (72797), 4035 states have call successors, (4035), 235 states have call predecessors, (4035), 235 states have return successors, (4035), 3850 states have call predecessors, (4035), 4035 states have call successors, (4035) [2025-03-08 11:24:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47856 states to 47856 states and 80867 transitions. [2025-03-08 11:24:38,349 INFO L78 Accepts]: Start accepts. Automaton has 47856 states and 80867 transitions. Word has length 573 [2025-03-08 11:24:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:38,350 INFO L471 AbstractCegarLoop]: Abstraction has 47856 states and 80867 transitions. [2025-03-08 11:24:38,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 47856 states and 80867 transitions. [2025-03-08 11:24:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 11:24:38,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:38,387 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:38,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:24:38,388 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:38,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash 315389752, now seen corresponding path program 1 times [2025-03-08 11:24:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950020375] [2025-03-08 11:24:38,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:38,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 11:24:38,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 11:24:38,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:38,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:38,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:38,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950020375] [2025-03-08 11:24:38,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950020375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:38,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:38,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:24:38,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967306966] [2025-03-08 11:24:38,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:38,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:24:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:38,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:24:38,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:24:38,794 INFO L87 Difference]: Start difference. First operand 47856 states and 80867 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:42,957 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 11:24:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:45,398 INFO L93 Difference]: Finished difference Result 155740 states and 263319 transitions. [2025-03-08 11:24:45,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:24:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 574 [2025-03-08 11:24:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:45,681 INFO L225 Difference]: With dead ends: 155740 [2025-03-08 11:24:45,682 INFO L226 Difference]: Without dead ends: 107930 [2025-03-08 11:24:45,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:24:45,783 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 913 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:45,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 2018 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 271 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 11:24:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107930 states. [2025-03-08 11:24:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107930 to 86488. [2025-03-08 11:24:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86488 states, 79545 states have (on average 1.6681501037148783) internal successors, (132693), 79874 states have internal predecessors, (132693), 6515 states have call successors, (6515), 427 states have call predecessors, (6515), 427 states have return successors, (6515), 6186 states have call predecessors, (6515), 6515 states have call successors, (6515) [2025-03-08 11:24:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86488 states to 86488 states and 145723 transitions. [2025-03-08 11:24:48,841 INFO L78 Accepts]: Start accepts. Automaton has 86488 states and 145723 transitions. Word has length 574 [2025-03-08 11:24:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:48,841 INFO L471 AbstractCegarLoop]: Abstraction has 86488 states and 145723 transitions. [2025-03-08 11:24:48,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:24:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 86488 states and 145723 transitions. [2025-03-08 11:24:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-08 11:24:48,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:48,893 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:24:48,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:24:48,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:48,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1614039010, now seen corresponding path program 1 times [2025-03-08 11:24:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523718973] [2025-03-08 11:24:48,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:48,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-08 11:24:49,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-08 11:24:49,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:49,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-08 11:24:51,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523718973] [2025-03-08 11:24:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523718973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:51,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:24:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138530466] [2025-03-08 11:24:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:51,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:24:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:51,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:24:51,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:24:51,277 INFO L87 Difference]: Start difference. First operand 86488 states and 145723 transitions. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-08 11:25:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:25:18,018 INFO L93 Difference]: Finished difference Result 676038 states and 1127410 transitions. [2025-03-08 11:25:18,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 11:25:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 574 [2025-03-08 11:25:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:25:19,968 INFO L225 Difference]: With dead ends: 676038 [2025-03-08 11:25:19,969 INFO L226 Difference]: Without dead ends: 589596 [2025-03-08 11:25:20,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:25:20,166 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 3002 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3002 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:25:20,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3002 Valid, 3586 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 11:25:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589596 states.