./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-17.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 3893bf360a85f05760b77c740edd1d0464d11dea1da72a67fc941d09eb87c9f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:05:40,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:05:40,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:05:40,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:05:40,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:05:40,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:05:40,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:05:40,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:05:40,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:05:40,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:05:40,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:05:40,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:05:40,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:05:40,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:05:40,487 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:05:40,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:05:40,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:05:40,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:05:40,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:05:40,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:05:40,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:05:40,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:05:40,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:05:40,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:05:40,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:05:40,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:05:40,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:05:40,490 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 -> 3893bf360a85f05760b77c740edd1d0464d11dea1da72a67fc941d09eb87c9f1 [2025-03-03 20:05:40,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:05:40,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:05:40,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:05:40,681 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:05:40,681 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:05:40,681 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-17.i [2025-03-03 20:05:41,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268e94e36/1df832bdb3ca49b1a8c21a2272d3e457/FLAGe78769f08 [2025-03-03 20:05:42,021 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:05:42,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-17.i [2025-03-03 20:05:42,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268e94e36/1df832bdb3ca49b1a8c21a2272d3e457/FLAGe78769f08 [2025-03-03 20:05:42,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/268e94e36/1df832bdb3ca49b1a8c21a2272d3e457 [2025-03-03 20:05:42,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:05:42,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:05:42,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:05:42,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:05:42,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:05:42,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758e891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42, skipping insertion in model container [2025-03-03 20:05:42,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:05:42,470 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-17.i[916,929] [2025-03-03 20:05:42,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:05:42,603 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:05:42,610 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-17.i[916,929] [2025-03-03 20:05:42,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:05:42,692 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:05:42,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42 WrapperNode [2025-03-03 20:05:42,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:05:42,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:05:42,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:05:42,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:05:42,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,758 INFO L138 Inliner]: procedures = 26, calls = 108, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 868 [2025-03-03 20:05:42,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:05:42,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:05:42,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:05:42,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:05:42,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,794 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-03 20:05:42,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,808 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:05:42,832 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:05:42,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:05:42,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:05:42,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (1/1) ... [2025-03-03 20:05:42,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:05:42,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:05:42,856 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-03 20:05:42,860 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-03 20:05:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:05:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:05:42,874 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:05:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:05:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:05:42,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:05:42,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:05:42,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:05:43,777 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L708: havoc property_#t~ite79#1;havoc property_#t~ite78#1;havoc property_#t~bitwise77#1;havoc property_#t~short80#1; [2025-03-03 20:05:43,953 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 20:05:43,953 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:05:43,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:05:43,987 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:05:43,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:05:43 BoogieIcfgContainer [2025-03-03 20:05:43,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:05:43,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:05:43,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:05:43,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:05:43,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:05:42" (1/3) ... [2025-03-03 20:05:43,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774688d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:05:43, skipping insertion in model container [2025-03-03 20:05:43,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:42" (2/3) ... [2025-03-03 20:05:43,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774688d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:05:43, skipping insertion in model container [2025-03-03 20:05:43,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:05:43" (3/3) ... [2025-03-03 20:05:43,994 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-17.i [2025-03-03 20:05:44,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:05:44,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-17.i that has 2 procedures, 362 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:05:44,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:05:44,074 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;@7cc3eae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:05:44,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:05:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 264 states have (on average 1.6136363636363635) internal successors, (426), 265 states have internal predecessors, (426), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 20:05:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:05:44,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:44,108 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:44,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:44,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash -354581086, now seen corresponding path program 1 times [2025-03-03 20:05:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535416298] [2025-03-03 20:05:44,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:44,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:05:44,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:05:44,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:44,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 188 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2025-03-03 20:05:44,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:44,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535416298] [2025-03-03 20:05:44,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535416298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:05:44,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544852810] [2025-03-03 20:05:44,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:44,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:05:44,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:05:44,630 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-03 20:05:44,631 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-03 20:05:44,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:05:44,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:05:44,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:44,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:44,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:05:44,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:05:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2025-03-03 20:05:45,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:05:45,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544852810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:45,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:05:45,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:05:45,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169913872] [2025-03-03 20:05:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:45,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:05:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:45,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:05:45,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:05:45,039 INFO L87 Difference]: Start difference. First operand has 362 states, 264 states have (on average 1.6136363636363635) internal successors, (426), 265 states have internal predecessors, (426), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:05:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:45,146 INFO L93 Difference]: Finished difference Result 718 states and 1322 transitions. [2025-03-03 20:05:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:05:45,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) Word has length 622 [2025-03-03 20:05:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:45,157 INFO L225 Difference]: With dead ends: 718 [2025-03-03 20:05:45,157 INFO L226 Difference]: Without dead ends: 359 [2025-03-03 20:05:45,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 623 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-03 20:05:45,164 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:45,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:05:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-03 20:05:45,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-03 20:05:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 262 states have (on average 1.5954198473282444) internal successors, (418), 262 states have internal predecessors, (418), 95 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 20:05:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 608 transitions. [2025-03-03 20:05:45,231 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 608 transitions. Word has length 622 [2025-03-03 20:05:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:45,233 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 608 transitions. [2025-03-03 20:05:45,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (95), 2 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:05:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 608 transitions. [2025-03-03 20:05:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-03 20:05:45,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:45,245 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:45,254 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-03 20:05:45,446 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-03 20:05:45,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:45,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash 643650947, now seen corresponding path program 1 times [2025-03-03 20:05:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111164841] [2025-03-03 20:05:45,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:45,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-03 20:05:45,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-03 20:05:45,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:45,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:05:46,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111164841] [2025-03-03 20:05:46,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111164841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:46,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:46,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099914549] [2025-03-03 20:05:46,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:46,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:46,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:46,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:46,010 INFO L87 Difference]: Start difference. First operand 359 states and 608 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:46,138 INFO L93 Difference]: Finished difference Result 1067 states and 1810 transitions. [2025-03-03 20:05:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 622 [2025-03-03 20:05:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:46,145 INFO L225 Difference]: With dead ends: 1067 [2025-03-03 20:05:46,146 INFO L226 Difference]: Without dead ends: 711 [2025-03-03 20:05:46,147 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-03 20:05:46,147 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 583 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:46,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1155 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-03 20:05:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 709. [2025-03-03 20:05:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 516 states have (on average 1.5910852713178294) internal successors, (821), 516 states have internal predecessors, (821), 190 states have call successors, (190), 2 states have call predecessors, (190), 2 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-03-03 20:05:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1201 transitions. [2025-03-03 20:05:46,228 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1201 transitions. Word has length 622 [2025-03-03 20:05:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:46,230 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1201 transitions. [2025-03-03 20:05:46,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1201 transitions. [2025-03-03 20:05:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-03 20:05:46,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:46,241 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:46,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:05:46,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:46,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:46,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1439271415, now seen corresponding path program 1 times [2025-03-03 20:05:46,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:46,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45516321] [2025-03-03 20:05:46,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:46,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 20:05:46,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 20:05:46,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:46,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:05:46,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:46,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45516321] [2025-03-03 20:05:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45516321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:46,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:46,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:46,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222550244] [2025-03-03 20:05:46,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:46,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:46,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:46,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:46,550 INFO L87 Difference]: Start difference. First operand 709 states and 1201 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:46,681 INFO L93 Difference]: Finished difference Result 1891 states and 3213 transitions. [2025-03-03 20:05:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:46,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 623 [2025-03-03 20:05:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:46,689 INFO L225 Difference]: With dead ends: 1891 [2025-03-03 20:05:46,689 INFO L226 Difference]: Without dead ends: 1185 [2025-03-03 20:05:46,691 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-03 20:05:46,691 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 373 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:46,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1221 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:05:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2025-03-03 20:05:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1181. [2025-03-03 20:05:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 930 states have (on average 1.621505376344086) internal successors, (1508), 932 states have internal predecessors, (1508), 246 states have call successors, (246), 4 states have call predecessors, (246), 4 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2025-03-03 20:05:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2000 transitions. [2025-03-03 20:05:46,786 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 2000 transitions. Word has length 623 [2025-03-03 20:05:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:46,786 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 2000 transitions. [2025-03-03 20:05:46,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 2000 transitions. [2025-03-03 20:05:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-03-03 20:05:46,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:46,795 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:46,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:05:46,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:46,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash -620326450, now seen corresponding path program 1 times [2025-03-03 20:05:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:46,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99278545] [2025-03-03 20:05:46,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:46,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-03-03 20:05:46,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-03-03 20:05:46,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:46,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:05:47,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:47,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99278545] [2025-03-03 20:05:47,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99278545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:47,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:47,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:05:47,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319678475] [2025-03-03 20:05:47,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:47,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:05:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:47,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:05:47,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:05:47,041 INFO L87 Difference]: Start difference. First operand 1181 states and 2000 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:47,148 INFO L93 Difference]: Finished difference Result 3019 states and 5080 transitions. [2025-03-03 20:05:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:05:47,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 624 [2025-03-03 20:05:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:47,161 INFO L225 Difference]: With dead ends: 3019 [2025-03-03 20:05:47,162 INFO L226 Difference]: Without dead ends: 1841 [2025-03-03 20:05:47,165 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-03 20:05:47,166 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 316 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:47,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1153 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:05:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-03-03 20:05:47,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1837. [2025-03-03 20:05:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1386 states have (on average 1.5786435786435786) internal successors, (2188), 1392 states have internal predecessors, (2188), 442 states have call successors, (442), 8 states have call predecessors, (442), 8 states have return successors, (442), 436 states have call predecessors, (442), 442 states have call successors, (442) [2025-03-03 20:05:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 3072 transitions. [2025-03-03 20:05:47,281 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 3072 transitions. Word has length 624 [2025-03-03 20:05:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:47,281 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 3072 transitions. [2025-03-03 20:05:47,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 3072 transitions. [2025-03-03 20:05:47,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-03-03 20:05:47,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:47,291 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:47,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:05:47,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:47,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:47,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1785320919, now seen corresponding path program 1 times [2025-03-03 20:05:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:47,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598709800] [2025-03-03 20:05:47,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:47,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-03-03 20:05:47,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-03-03 20:05:47,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:47,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:05:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598709800] [2025-03-03 20:05:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598709800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:47,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:47,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:05:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203831134] [2025-03-03 20:05:47,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:47,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:05:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:47,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:05:47,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:05:47,658 INFO L87 Difference]: Start difference. First operand 1837 states and 3072 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:48,281 INFO L93 Difference]: Finished difference Result 6701 states and 11092 transitions. [2025-03-03 20:05:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:05:48,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 625 [2025-03-03 20:05:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:48,304 INFO L225 Difference]: With dead ends: 6701 [2025-03-03 20:05:48,304 INFO L226 Difference]: Without dead ends: 4867 [2025-03-03 20:05:48,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:05:48,310 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 627 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:48,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 3014 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:05:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2025-03-03 20:05:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 3269. [2025-03-03 20:05:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 2634 states have (on average 1.612756264236902) internal successors, (4248), 2648 states have internal predecessors, (4248), 618 states have call successors, (618), 16 states have call predecessors, (618), 16 states have return successors, (618), 604 states have call predecessors, (618), 618 states have call successors, (618) [2025-03-03 20:05:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 5484 transitions. [2025-03-03 20:05:48,511 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 5484 transitions. Word has length 625 [2025-03-03 20:05:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:48,512 INFO L471 AbstractCegarLoop]: Abstraction has 3269 states and 5484 transitions. [2025-03-03 20:05:48,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 5484 transitions. [2025-03-03 20:05:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2025-03-03 20:05:48,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:48,543 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:48,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:05:48,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:48,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1980727338, now seen corresponding path program 1 times [2025-03-03 20:05:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154190328] [2025-03-03 20:05:48,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:48,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes. [2025-03-03 20:05:48,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements. [2025-03-03 20:05:48,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:48,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:05:49,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:49,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154190328] [2025-03-03 20:05:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154190328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:05:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746559328] [2025-03-03 20:05:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:49,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:05:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:49,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:05:49,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:05:49,269 INFO L87 Difference]: Start difference. First operand 3269 states and 5484 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:49,839 INFO L93 Difference]: Finished difference Result 8866 states and 14963 transitions. [2025-03-03 20:05:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:05:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 625 [2025-03-03 20:05:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:49,863 INFO L225 Difference]: With dead ends: 8866 [2025-03-03 20:05:49,863 INFO L226 Difference]: Without dead ends: 5600 [2025-03-03 20:05:49,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:05:49,872 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 647 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:49,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 2112 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:05:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5600 states. [2025-03-03 20:05:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5600 to 5118. [2025-03-03 20:05:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5118 states, 4386 states have (on average 1.661422708618331) internal successors, (7287), 4400 states have internal predecessors, (7287), 713 states have call successors, (713), 18 states have call predecessors, (713), 18 states have return successors, (713), 699 states have call predecessors, (713), 713 states have call successors, (713) [2025-03-03 20:05:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 8713 transitions. [2025-03-03 20:05:50,101 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 8713 transitions. Word has length 625 [2025-03-03 20:05:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:05:50,102 INFO L471 AbstractCegarLoop]: Abstraction has 5118 states and 8713 transitions. [2025-03-03 20:05:50,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:05:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 8713 transitions. [2025-03-03 20:05:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 20:05:50,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:50,108 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:05:50,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:05:50,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:50,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -271242870, now seen corresponding path program 1 times [2025-03-03 20:05:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:50,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031004629] [2025-03-03 20:05:50,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:50,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 20:05:50,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 20:05:50,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:50,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:05:51,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:51,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031004629] [2025-03-03 20:05:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031004629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:05:51,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:05:51,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 20:05:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026546919] [2025-03-03 20:05:51,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:05:51,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 20:05:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:05:51,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 20:05:51,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:05:51,783 INFO L87 Difference]: Start difference. First operand 5118 states and 8713 transitions. Second operand has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:05:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:05:59,371 INFO L93 Difference]: Finished difference Result 31024 states and 51781 transitions. [2025-03-03 20:05:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 20:05:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) Word has length 626 [2025-03-03 20:05:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:05:59,451 INFO L225 Difference]: With dead ends: 31024 [2025-03-03 20:05:59,451 INFO L226 Difference]: Without dead ends: 27660 [2025-03-03 20:05:59,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=872, Invalid=2434, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 20:05:59,470 INFO L435 NwaCegarLoop]: 1943 mSDtfsCounter, 7444 mSDsluCounter, 11924 mSDsCounter, 0 mSdLazyCounter, 6414 mSolverCounterSat, 940 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7444 SdHoareTripleChecker+Valid, 13867 SdHoareTripleChecker+Invalid, 7354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 940 IncrementalHoareTripleChecker+Valid, 6414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:05:59,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7444 Valid, 13867 Invalid, 7354 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [940 Valid, 6414 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-03 20:05:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27660 states. [2025-03-03 20:06:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27660 to 15651. [2025-03-03 20:06:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15651 states, 13851 states have (on average 1.6786513609125695) internal successors, (23251), 13899 states have internal predecessors, (23251), 1739 states have call successors, (1739), 60 states have call predecessors, (1739), 60 states have return successors, (1739), 1691 states have call predecessors, (1739), 1739 states have call successors, (1739) [2025-03-03 20:06:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15651 states to 15651 states and 26729 transitions. [2025-03-03 20:06:00,098 INFO L78 Accepts]: Start accepts. Automaton has 15651 states and 26729 transitions. Word has length 626 [2025-03-03 20:06:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:00,100 INFO L471 AbstractCegarLoop]: Abstraction has 15651 states and 26729 transitions. [2025-03-03 20:06:00,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.0) internal successors, (154), 14 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:06:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 15651 states and 26729 transitions. [2025-03-03 20:06:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 20:06:00,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:00,111 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:00,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:06:00,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:00,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:00,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1107429872, now seen corresponding path program 1 times [2025-03-03 20:06:00,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:00,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610717525] [2025-03-03 20:06:00,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:00,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:00,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 20:06:00,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 20:06:00,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:00,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:06:00,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:00,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610717525] [2025-03-03 20:06:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610717525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:00,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:00,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:00,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839365852] [2025-03-03 20:06:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:00,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:00,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:00,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:00,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:00,303 INFO L87 Difference]: Start difference. First operand 15651 states and 26729 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:06:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:00,616 INFO L93 Difference]: Finished difference Result 28132 states and 47805 transitions. [2025-03-03 20:06:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 626 [2025-03-03 20:06:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:00,659 INFO L225 Difference]: With dead ends: 28132 [2025-03-03 20:06:00,659 INFO L226 Difference]: Without dead ends: 15712 [2025-03-03 20:06:00,676 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-03 20:06:00,676 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 356 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:00,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1357 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15712 states. [2025-03-03 20:06:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15712 to 13514. [2025-03-03 20:06:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13514 states, 12289 states have (on average 1.6972088859956058) internal successors, (20857), 12313 states have internal predecessors, (20857), 1179 states have call successors, (1179), 45 states have call predecessors, (1179), 45 states have return successors, (1179), 1155 states have call predecessors, (1179), 1179 states have call successors, (1179) [2025-03-03 20:06:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13514 states to 13514 states and 23215 transitions. [2025-03-03 20:06:01,101 INFO L78 Accepts]: Start accepts. Automaton has 13514 states and 23215 transitions. Word has length 626 [2025-03-03 20:06:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:01,102 INFO L471 AbstractCegarLoop]: Abstraction has 13514 states and 23215 transitions. [2025-03-03 20:06:01,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:06:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 13514 states and 23215 transitions. [2025-03-03 20:06:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 20:06:01,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:01,116 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:01,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:06:01,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:01,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:01,117 INFO L85 PathProgramCache]: Analyzing trace with hash -669064720, now seen corresponding path program 1 times [2025-03-03 20:06:01,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:01,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309421893] [2025-03-03 20:06:01,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:01,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 20:06:01,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 20:06:01,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:01,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:06:02,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:02,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309421893] [2025-03-03 20:06:02,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309421893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:02,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:06:02,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535290964] [2025-03-03 20:06:02,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:06:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:02,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:06:02,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:06:02,557 INFO L87 Difference]: Start difference. First operand 13514 states and 23215 transitions. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:06:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:06,304 INFO L93 Difference]: Finished difference Result 42940 states and 72485 transitions. [2025-03-03 20:06:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:06:06,305 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 626 [2025-03-03 20:06:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:06,385 INFO L225 Difference]: With dead ends: 42940 [2025-03-03 20:06:06,386 INFO L226 Difference]: Without dead ends: 32370 [2025-03-03 20:06:06,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2025-03-03 20:06:06,406 INFO L435 NwaCegarLoop]: 1188 mSDtfsCounter, 6158 mSDsluCounter, 5187 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6158 SdHoareTripleChecker+Valid, 6375 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:06,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6158 Valid, 6375 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 20:06:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32370 states. [2025-03-03 20:06:07,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32370 to 22346. [2025-03-03 20:06:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22346 states, 19992 states have (on average 1.6797719087635055) internal successors, (33582), 20045 states have internal predecessors, (33582), 2254 states have call successors, (2254), 99 states have call predecessors, (2254), 99 states have return successors, (2254), 2201 states have call predecessors, (2254), 2254 states have call successors, (2254) [2025-03-03 20:06:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22346 states to 22346 states and 38090 transitions. [2025-03-03 20:06:07,462 INFO L78 Accepts]: Start accepts. Automaton has 22346 states and 38090 transitions. Word has length 626 [2025-03-03 20:06:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:07,463 INFO L471 AbstractCegarLoop]: Abstraction has 22346 states and 38090 transitions. [2025-03-03 20:06:07,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:06:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 22346 states and 38090 transitions. [2025-03-03 20:06:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 20:06:07,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:07,477 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:07,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:06:07,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:07,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:07,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1301874737, now seen corresponding path program 1 times [2025-03-03 20:06:07,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:07,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895886893] [2025-03-03 20:06:07,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:07,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:07,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 20:06:07,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 20:06:07,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:07,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:06:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895886893] [2025-03-03 20:06:08,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895886893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:08,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:08,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 20:06:08,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509249710] [2025-03-03 20:06:08,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:08,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:06:08,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:08,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:06:08,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:06:08,211 INFO L87 Difference]: Start difference. First operand 22346 states and 38090 transitions. Second operand has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:06:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:14,149 INFO L93 Difference]: Finished difference Result 87222 states and 145886 transitions. [2025-03-03 20:06:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 20:06:14,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) Word has length 626 [2025-03-03 20:06:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:14,301 INFO L225 Difference]: With dead ends: 87222 [2025-03-03 20:06:14,301 INFO L226 Difference]: Without dead ends: 69860 [2025-03-03 20:06:14,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=532, Invalid=1538, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 20:06:14,345 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 7938 mSDsluCounter, 8887 mSDsCounter, 0 mSdLazyCounter, 4589 mSolverCounterSat, 1259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7938 SdHoareTripleChecker+Valid, 10442 SdHoareTripleChecker+Invalid, 5848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1259 IncrementalHoareTripleChecker+Valid, 4589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:14,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7938 Valid, 10442 Invalid, 5848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1259 Valid, 4589 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 20:06:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69860 states. [2025-03-03 20:06:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69860 to 32050. [2025-03-03 20:06:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32050 states, 28476 states have (on average 1.6739008287680854) internal successors, (47666), 28557 states have internal predecessors, (47666), 3422 states have call successors, (3422), 151 states have call predecessors, (3422), 151 states have return successors, (3422), 3341 states have call predecessors, (3422), 3422 states have call successors, (3422) [2025-03-03 20:06:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32050 states to 32050 states and 54510 transitions. [2025-03-03 20:06:15,880 INFO L78 Accepts]: Start accepts. Automaton has 32050 states and 54510 transitions. Word has length 626 [2025-03-03 20:06:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:15,881 INFO L471 AbstractCegarLoop]: Abstraction has 32050 states and 54510 transitions. [2025-03-03 20:06:15,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.833333333333334) internal successors, (154), 12 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:06:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32050 states and 54510 transitions. [2025-03-03 20:06:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 20:06:15,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:15,897 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:15,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:06:15,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:15,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1241533877, now seen corresponding path program 1 times [2025-03-03 20:06:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:15,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632585477] [2025-03-03 20:06:15,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:15,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:15,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 20:06:16,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 20:06:16,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:16,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:06:17,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:17,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632585477] [2025-03-03 20:06:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632585477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:17,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:17,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:06:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439390640] [2025-03-03 20:06:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:17,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:06:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:17,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:06:17,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:06:17,665 INFO L87 Difference]: Start difference. First operand 32050 states and 54510 transitions. Second operand has 13 states, 13 states have (on average 11.846153846153847) internal successors, (154), 13 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:06:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:26,859 INFO L93 Difference]: Finished difference Result 68923 states and 115368 transitions. [2025-03-03 20:06:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 20:06:26,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.846153846153847) internal successors, (154), 13 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) Word has length 626 [2025-03-03 20:06:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:26,984 INFO L225 Difference]: With dead ends: 68923 [2025-03-03 20:06:26,985 INFO L226 Difference]: Without dead ends: 60178 [2025-03-03 20:06:27,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=604, Invalid=1466, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 20:06:27,019 INFO L435 NwaCegarLoop]: 1810 mSDtfsCounter, 4949 mSDsluCounter, 10767 mSDsCounter, 0 mSdLazyCounter, 6361 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4949 SdHoareTripleChecker+Valid, 12577 SdHoareTripleChecker+Invalid, 7080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 6361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:27,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4949 Valid, 12577 Invalid, 7080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 6361 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 20:06:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60178 states. [2025-03-03 20:06:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60178 to 40432. [2025-03-03 20:06:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40432 states, 35764 states have (on average 1.667207247511464) internal successors, (59626), 35875 states have internal predecessors, (59626), 4440 states have call successors, (4440), 227 states have call predecessors, (4440), 227 states have return successors, (4440), 4329 states have call predecessors, (4440), 4440 states have call successors, (4440) [2025-03-03 20:06:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40432 states to 40432 states and 68506 transitions. [2025-03-03 20:06:28,793 INFO L78 Accepts]: Start accepts. Automaton has 40432 states and 68506 transitions. Word has length 626 [2025-03-03 20:06:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:28,794 INFO L471 AbstractCegarLoop]: Abstraction has 40432 states and 68506 transitions. [2025-03-03 20:06:28,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.846153846153847) internal successors, (154), 13 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:06:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 40432 states and 68506 transitions. [2025-03-03 20:06:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 20:06:28,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:28,809 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:28,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:06:28,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:28,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1770452916, now seen corresponding path program 1 times [2025-03-03 20:06:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683682657] [2025-03-03 20:06:28,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:28,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 20:06:28,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 20:06:28,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:28,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:06:28,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:28,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683682657] [2025-03-03 20:06:28,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683682657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650612652] [2025-03-03 20:06:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:28,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:28,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:28,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:28,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:28,929 INFO L87 Difference]: Start difference. First operand 40432 states and 68506 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:06:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:31,653 INFO L93 Difference]: Finished difference Result 110411 states and 186788 transitions. [2025-03-03 20:06:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) Word has length 626 [2025-03-03 20:06:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:31,828 INFO L225 Difference]: With dead ends: 110411 [2025-03-03 20:06:31,828 INFO L226 Difference]: Without dead ends: 71378 [2025-03-03 20:06:31,903 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-03 20:06:31,905 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 385 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:31,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1377 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71378 states. [2025-03-03 20:06:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71378 to 71352. [2025-03-03 20:06:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71352 states, 63529 states have (on average 1.6432337987375845) internal successors, (104393), 63748 states have internal predecessors, (104393), 7392 states have call successors, (7392), 430 states have call predecessors, (7392), 430 states have return successors, (7392), 7173 states have call predecessors, (7392), 7392 states have call successors, (7392) [2025-03-03 20:06:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71352 states to 71352 states and 119177 transitions. [2025-03-03 20:06:34,792 INFO L78 Accepts]: Start accepts. Automaton has 71352 states and 119177 transitions. Word has length 626 [2025-03-03 20:06:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:34,793 INFO L471 AbstractCegarLoop]: Abstraction has 71352 states and 119177 transitions. [2025-03-03 20:06:34,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 1 states have call predecessors, (95), 1 states have call successors, (95) [2025-03-03 20:06:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 71352 states and 119177 transitions. [2025-03-03 20:06:34,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-03 20:06:34,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:34,817 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:34,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:06:34,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:34,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:34,818 INFO L85 PathProgramCache]: Analyzing trace with hash 331583730, now seen corresponding path program 1 times [2025-03-03 20:06:34,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:34,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110403405] [2025-03-03 20:06:34,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:34,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:34,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-03 20:06:34,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-03 20:06:34,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:34,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:06:35,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110403405] [2025-03-03 20:06:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110403405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:35,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:06:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881546419] [2025-03-03 20:06:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:35,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:06:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:35,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:06:35,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:06:35,305 INFO L87 Difference]: Start difference. First operand 71352 states and 119177 transitions. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:06:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:46,550 INFO L93 Difference]: Finished difference Result 267701 states and 438982 transitions. [2025-03-03 20:06:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 20:06:46,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) Word has length 626 [2025-03-03 20:06:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:47,077 INFO L225 Difference]: With dead ends: 267701 [2025-03-03 20:06:47,077 INFO L226 Difference]: Without dead ends: 213245 [2025-03-03 20:06:47,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2025-03-03 20:06:47,196 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 4129 mSDsluCounter, 7516 mSDsCounter, 0 mSdLazyCounter, 3678 mSolverCounterSat, 635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4129 SdHoareTripleChecker+Valid, 9023 SdHoareTripleChecker+Invalid, 4313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 3678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:47,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4129 Valid, 9023 Invalid, 4313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 3678 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 20:06:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213245 states. [2025-03-03 20:06:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213245 to 131800. [2025-03-03 20:06:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131800 states, 117231 states have (on average 1.6362054405404713) internal successors, (191814), 117726 states have internal predecessors, (191814), 13752 states have call successors, (13752), 816 states have call predecessors, (13752), 816 states have return successors, (13752), 13257 states have call predecessors, (13752), 13752 states have call successors, (13752) [2025-03-03 20:06:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131800 states to 131800 states and 219318 transitions. [2025-03-03 20:06:54,732 INFO L78 Accepts]: Start accepts. Automaton has 131800 states and 219318 transitions. Word has length 626 [2025-03-03 20:06:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:54,732 INFO L471 AbstractCegarLoop]: Abstraction has 131800 states and 219318 transitions. [2025-03-03 20:06:54,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95) [2025-03-03 20:06:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 131800 states and 219318 transitions. [2025-03-03 20:06:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-03-03 20:06:54,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:54,776 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:06:54,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:54,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:54,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1686282403, now seen corresponding path program 1 times [2025-03-03 20:06:54,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019957309] [2025-03-03 20:06:54,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-03-03 20:06:54,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-03-03 20:06:54,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:54,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 17860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17860 trivial. 0 not checked. [2025-03-03 20:06:55,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:55,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019957309] [2025-03-03 20:06:55,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019957309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:55,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:55,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 20:06:55,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891488614] [2025-03-03 20:06:55,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:55,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:06:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:55,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:06:55,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:06:55,887 INFO L87 Difference]: Start difference. First operand 131800 states and 219318 transitions. Second operand has 12 states, 12 states have (on average 12.916666666666666) internal successors, (155), 12 states have internal predecessors, (155), 2 states have call successors, (95), 1 states have call predecessors, (95), 1 states have return successors, (95), 2 states have call predecessors, (95), 2 states have call successors, (95)