./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-6.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 1ba4c7d0d6c78135dc83153b960bec2a5b9f7da175d8a397216db5ad620f7338 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:59:31,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:59:31,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:59:31,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:59:31,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:59:31,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:59:31,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:59:31,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:59:31,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:59:31,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:59:31,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:59:31,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:59:31,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:59:31,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:59:31,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:59:31,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:59:31,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:31,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:59:31,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:59:31,375 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-jdk21/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 -> 1ba4c7d0d6c78135dc83153b960bec2a5b9f7da175d8a397216db5ad620f7338 [2025-02-05 21:59:31,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:59:31,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:59:31,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:59:31,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:59:31,603 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:59:31,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-6.i [2025-02-05 21:59:32,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b83b36e/7000404c519c4735b0aefe7bdb9fa234/FLAGbd07c1c37 [2025-02-05 21:59:33,050 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:59:33,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-6.i [2025-02-05 21:59:33,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b83b36e/7000404c519c4735b0aefe7bdb9fa234/FLAGbd07c1c37 [2025-02-05 21:59:33,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/58b83b36e/7000404c519c4735b0aefe7bdb9fa234 [2025-02-05 21:59:33,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:59:33,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:59:33,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:33,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:59:33,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:59:33,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a9f603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33, skipping insertion in model container [2025-02-05 21:59:33,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:59:33,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-6.i[915,928] [2025-02-05 21:59:33,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:33,624 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:59:33,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-6.i[915,928] [2025-02-05 21:59:33,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:33,693 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:59:33,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33 WrapperNode [2025-02-05 21:59:33,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:33,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:33,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:59:33,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:59:33,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,763 INFO L138 Inliner]: procedures = 26, calls = 112, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 777 [2025-02-05 21:59:33,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:33,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:59:33,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:59:33,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:59:33,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,829 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-02-05 21:59:33,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,860 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:59:33,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:59:33,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:59:33,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:59:33,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (1/1) ... [2025-02-05 21:59:33,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:33,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:33,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:59:33,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:59:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:59:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:59:33,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:59:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:59:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:59:33,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:59:34,067 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:59:34,068 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:59:34,904 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 21:59:34,905 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:59:34,924 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:59:34,924 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:59:34,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:34 BoogieIcfgContainer [2025-02-05 21:59:34,925 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:59:34,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:59:34,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:59:34,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:59:34,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:59:33" (1/3) ... [2025-02-05 21:59:34,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37efb0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:34, skipping insertion in model container [2025-02-05 21:59:34,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:33" (2/3) ... [2025-02-05 21:59:34,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37efb0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:34, skipping insertion in model container [2025-02-05 21:59:34,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:34" (3/3) ... [2025-02-05 21:59:34,935 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-6.i [2025-02-05 21:59:34,945 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:59:34,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-6.i that has 2 procedures, 320 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:59:35,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:59:35,015 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;@6fd8ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:59:35,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:59:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 218 states have (on average 1.6009174311926606) internal successors, (349), 219 states have internal predecessors, (349), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:59:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2025-02-05 21:59:35,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:35,053 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:35,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 725080658, now seen corresponding path program 1 times [2025-02-05 21:59:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624703126] [2025-02-05 21:59:35,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:35,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 636 statements into 1 equivalence classes. [2025-02-05 21:59:35,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 636 of 636 statements. [2025-02-05 21:59:35,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:35,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-02-05 21:59:35,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624703126] [2025-02-05 21:59:35,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624703126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:59:35,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614084670] [2025-02-05 21:59:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:35,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:59:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:35,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:59:35,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:59:35,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 636 statements into 1 equivalence classes. [2025-02-05 21:59:35,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 636 of 636 statements. [2025-02-05 21:59:35,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:35,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:35,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:59:35,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:59:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-02-05 21:59:35,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:59:35,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614084670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:35,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:59:35,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:59:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528862688] [2025-02-05 21:59:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:35,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:59:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:35,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:59:35,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:35,999 INFO L87 Difference]: Start difference. First operand has 320 states, 218 states have (on average 1.6009174311926606) internal successors, (349), 219 states have internal predecessors, (349), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:59:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:36,092 INFO L93 Difference]: Finished difference Result 634 states and 1188 transitions. [2025-02-05 21:59:36,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:59:36,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) Word has length 636 [2025-02-05 21:59:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:36,104 INFO L225 Difference]: With dead ends: 634 [2025-02-05 21:59:36,106 INFO L226 Difference]: Without dead ends: 317 [2025-02-05 21:59:36,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 637 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-02-05 21:59:36,118 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:36,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 529 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-05 21:59:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-02-05 21:59:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 216 states have (on average 1.5740740740740742) internal successors, (340), 216 states have internal predecessors, (340), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:59:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 538 transitions. [2025-02-05 21:59:36,209 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 538 transitions. Word has length 636 [2025-02-05 21:59:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:36,211 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 538 transitions. [2025-02-05 21:59:36,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.0) internal successors, (146), 2 states have internal predecessors, (146), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:59:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 538 transitions. [2025-02-05 21:59:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-02-05 21:59:36,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:36,223 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:36,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:59:36,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:59:36,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:36,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:36,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2037671939, now seen corresponding path program 1 times [2025-02-05 21:59:36,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:36,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054167911] [2025-02-05 21:59:36,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:36,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:36,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-02-05 21:59:36,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-02-05 21:59:36,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:36,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:37,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054167911] [2025-02-05 21:59:37,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054167911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:37,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:37,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:37,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943814892] [2025-02-05 21:59:37,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:37,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:37,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:37,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:37,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:37,005 INFO L87 Difference]: Start difference. First operand 317 states and 538 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:37,127 INFO L93 Difference]: Finished difference Result 797 states and 1364 transitions. [2025-02-05 21:59:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:37,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 637 [2025-02-05 21:59:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:37,137 INFO L225 Difference]: With dead ends: 797 [2025-02-05 21:59:37,139 INFO L226 Difference]: Without dead ends: 483 [2025-02-05 21:59:37,140 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-02-05 21:59:37,141 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 280 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:37,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1160 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-02-05 21:59:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 480. [2025-02-05 21:59:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 365 states have (on average 1.632876712328767) internal successors, (596), 366 states have internal predecessors, (596), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 21:59:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 820 transitions. [2025-02-05 21:59:37,209 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 820 transitions. Word has length 637 [2025-02-05 21:59:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:37,211 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 820 transitions. [2025-02-05 21:59:37,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 820 transitions. [2025-02-05 21:59:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2025-02-05 21:59:37,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:37,228 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:37,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:59:37,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:37,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -467226460, now seen corresponding path program 1 times [2025-02-05 21:59:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694908465] [2025-02-05 21:59:37,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:37,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:37,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 639 statements into 1 equivalence classes. [2025-02-05 21:59:37,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 639 of 639 statements. [2025-02-05 21:59:37,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:37,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:37,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:37,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694908465] [2025-02-05 21:59:37,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694908465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:37,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:37,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:37,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395624883] [2025-02-05 21:59:37,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:37,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:37,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:37,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:37,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:37,566 INFO L87 Difference]: Start difference. First operand 480 states and 820 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:37,674 INFO L93 Difference]: Finished difference Result 1275 states and 2185 transitions. [2025-02-05 21:59:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 639 [2025-02-05 21:59:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:37,686 INFO L225 Difference]: With dead ends: 1275 [2025-02-05 21:59:37,687 INFO L226 Difference]: Without dead ends: 798 [2025-02-05 21:59:37,690 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-02-05 21:59:37,690 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 318 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:37,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1234 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-05 21:59:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 795. [2025-02-05 21:59:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 620 states have (on average 1.6370967741935485) internal successors, (1015), 623 states have internal predecessors, (1015), 170 states have call successors, (170), 4 states have call predecessors, (170), 4 states have return successors, (170), 167 states have call predecessors, (170), 170 states have call successors, (170) [2025-02-05 21:59:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1355 transitions. [2025-02-05 21:59:37,761 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1355 transitions. Word has length 639 [2025-02-05 21:59:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:37,764 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1355 transitions. [2025-02-05 21:59:37,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1355 transitions. [2025-02-05 21:59:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2025-02-05 21:59:37,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:37,775 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:37,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:59:37,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:37,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:37,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1662759844, now seen corresponding path program 1 times [2025-02-05 21:59:37,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:37,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562187946] [2025-02-05 21:59:37,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:37,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes. [2025-02-05 21:59:37,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements. [2025-02-05 21:59:37,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:37,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:38,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562187946] [2025-02-05 21:59:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562187946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:38,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:38,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:38,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404835690] [2025-02-05 21:59:38,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:38,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:38,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:38,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:38,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:38,116 INFO L87 Difference]: Start difference. First operand 795 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:38,245 INFO L93 Difference]: Finished difference Result 2379 states and 4059 transitions. [2025-02-05 21:59:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 640 [2025-02-05 21:59:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:38,254 INFO L225 Difference]: With dead ends: 2379 [2025-02-05 21:59:38,254 INFO L226 Difference]: Without dead ends: 1587 [2025-02-05 21:59:38,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:38,256 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 521 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:38,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1376 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-02-05 21:59:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 871. [2025-02-05 21:59:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 696 states have (on average 1.6364942528735633) internal successors, (1139), 699 states have internal predecessors, (1139), 170 states have call successors, (170), 4 states have call predecessors, (170), 4 states have return successors, (170), 167 states have call predecessors, (170), 170 states have call successors, (170) [2025-02-05 21:59:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1479 transitions. [2025-02-05 21:59:38,320 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1479 transitions. Word has length 640 [2025-02-05 21:59:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:38,320 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1479 transitions. [2025-02-05 21:59:38,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1479 transitions. [2025-02-05 21:59:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2025-02-05 21:59:38,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:38,325 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:38,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:59:38,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:38,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:38,326 INFO L85 PathProgramCache]: Analyzing trace with hash -672841446, now seen corresponding path program 1 times [2025-02-05 21:59:38,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:38,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725928820] [2025-02-05 21:59:38,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:38,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:38,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes. [2025-02-05 21:59:38,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements. [2025-02-05 21:59:38,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:38,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:38,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725928820] [2025-02-05 21:59:38,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725928820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:38,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:38,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:38,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959238929] [2025-02-05 21:59:38,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:38,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:38,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:38,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:38,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:38,556 INFO L87 Difference]: Start difference. First operand 871 states and 1479 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:38,640 INFO L93 Difference]: Finished difference Result 1747 states and 2962 transitions. [2025-02-05 21:59:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:38,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 640 [2025-02-05 21:59:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:38,646 INFO L225 Difference]: With dead ends: 1747 [2025-02-05 21:59:38,646 INFO L226 Difference]: Without dead ends: 879 [2025-02-05 21:59:38,648 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-02-05 21:59:38,649 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 290 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:38,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1043 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-02-05 21:59:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 715. [2025-02-05 21:59:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 599 states have (on average 1.652754590984975) internal successors, (990), 600 states have internal predecessors, (990), 112 states have call successors, (112), 3 states have call predecessors, (112), 3 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 21:59:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1214 transitions. [2025-02-05 21:59:38,682 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1214 transitions. Word has length 640 [2025-02-05 21:59:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:38,683 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1214 transitions. [2025-02-05 21:59:38,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1214 transitions. [2025-02-05 21:59:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2025-02-05 21:59:38,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:38,690 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:38,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:59:38,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:38,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1438180806, now seen corresponding path program 1 times [2025-02-05 21:59:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:38,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318029255] [2025-02-05 21:59:38,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:38,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:38,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes. [2025-02-05 21:59:38,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements. [2025-02-05 21:59:38,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:38,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:38,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318029255] [2025-02-05 21:59:38,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318029255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:38,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:38,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:38,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173601895] [2025-02-05 21:59:38,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:38,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:38,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:38,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:38,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:38,925 INFO L87 Difference]: Start difference. First operand 715 states and 1214 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:38,994 INFO L93 Difference]: Finished difference Result 1434 states and 2430 transitions. [2025-02-05 21:59:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:38,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 640 [2025-02-05 21:59:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:39,002 INFO L225 Difference]: With dead ends: 1434 [2025-02-05 21:59:39,002 INFO L226 Difference]: Without dead ends: 722 [2025-02-05 21:59:39,004 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-02-05 21:59:39,004 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 242 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:39,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1083 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-02-05 21:59:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 656. [2025-02-05 21:59:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 553 states have (on average 1.6401446654611211) internal successors, (907), 553 states have internal predecessors, (907), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:59:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1105 transitions. [2025-02-05 21:59:39,024 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1105 transitions. Word has length 640 [2025-02-05 21:59:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:39,024 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1105 transitions. [2025-02-05 21:59:39,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1105 transitions. [2025-02-05 21:59:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:39,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:39,029 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:39,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:59:39,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:39,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -973540376, now seen corresponding path program 1 times [2025-02-05 21:59:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126373741] [2025-02-05 21:59:39,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:39,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:39,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:39,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:39,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:39,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:39,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:39,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126373741] [2025-02-05 21:59:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126373741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:39,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:39,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:39,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321524987] [2025-02-05 21:59:39,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:39,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:39,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:39,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:39,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:39,201 INFO L87 Difference]: Start difference. First operand 656 states and 1105 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:39,281 INFO L93 Difference]: Finished difference Result 1728 states and 2928 transitions. [2025-02-05 21:59:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:39,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 641 [2025-02-05 21:59:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:39,287 INFO L225 Difference]: With dead ends: 1728 [2025-02-05 21:59:39,287 INFO L226 Difference]: Without dead ends: 1075 [2025-02-05 21:59:39,288 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-02-05 21:59:39,288 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 306 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:39,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1038 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2025-02-05 21:59:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1072. [2025-02-05 21:59:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 899 states have (on average 1.64293659621802) internal successors, (1477), 900 states have internal predecessors, (1477), 166 states have call successors, (166), 6 states have call predecessors, (166), 6 states have return successors, (166), 165 states have call predecessors, (166), 166 states have call successors, (166) [2025-02-05 21:59:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1809 transitions. [2025-02-05 21:59:39,336 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1809 transitions. Word has length 641 [2025-02-05 21:59:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:39,336 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1809 transitions. [2025-02-05 21:59:39,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1809 transitions. [2025-02-05 21:59:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-02-05 21:59:39,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:39,341 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:39,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:59:39,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:39,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:39,342 INFO L85 PathProgramCache]: Analyzing trace with hash -125789304, now seen corresponding path program 1 times [2025-02-05 21:59:39,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49398823] [2025-02-05 21:59:39,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:39,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-02-05 21:59:39,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-02-05 21:59:39,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:39,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:39,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:39,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49398823] [2025-02-05 21:59:39,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49398823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:39,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:39,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593994938] [2025-02-05 21:59:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:39,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:39,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:39,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:39,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:39,674 INFO L87 Difference]: Start difference. First operand 1072 states and 1809 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:39,750 INFO L93 Difference]: Finished difference Result 3210 states and 5421 transitions. [2025-02-05 21:59:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 641 [2025-02-05 21:59:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:39,761 INFO L225 Difference]: With dead ends: 3210 [2025-02-05 21:59:39,761 INFO L226 Difference]: Without dead ends: 2141 [2025-02-05 21:59:39,763 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-02-05 21:59:39,763 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 327 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:39,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1148 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2025-02-05 21:59:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2131. [2025-02-05 21:59:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 1786 states have (on average 1.6382978723404256) internal successors, (2926), 1788 states have internal predecessors, (2926), 332 states have call successors, (332), 12 states have call predecessors, (332), 12 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2025-02-05 21:59:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3590 transitions. [2025-02-05 21:59:39,841 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3590 transitions. Word has length 641 [2025-02-05 21:59:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:39,842 INFO L471 AbstractCegarLoop]: Abstraction has 2131 states and 3590 transitions. [2025-02-05 21:59:39,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3590 transitions. [2025-02-05 21:59:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 21:59:39,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:39,847 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:39,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:39,847 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:39,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1807931496, now seen corresponding path program 1 times [2025-02-05 21:59:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837083860] [2025-02-05 21:59:39,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:39,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:59:39,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:59:39,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:39,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:40,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:40,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837083860] [2025-02-05 21:59:40,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837083860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:40,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:40,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:40,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052786034] [2025-02-05 21:59:40,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:40,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:40,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:40,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:40,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:40,290 INFO L87 Difference]: Start difference. First operand 2131 states and 3590 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:40,430 INFO L93 Difference]: Finished difference Result 6243 states and 10524 transitions. [2025-02-05 21:59:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:40,431 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 642 [2025-02-05 21:59:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:40,451 INFO L225 Difference]: With dead ends: 6243 [2025-02-05 21:59:40,452 INFO L226 Difference]: Without dead ends: 4115 [2025-02-05 21:59:40,458 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-02-05 21:59:40,459 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 494 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:40,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1410 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2025-02-05 21:59:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 3079. [2025-02-05 21:59:40,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3079 states, 2734 states have (on average 1.692026335040234) internal successors, (4626), 2736 states have internal predecessors, (4626), 332 states have call successors, (332), 12 states have call predecessors, (332), 12 states have return successors, (332), 330 states have call predecessors, (332), 332 states have call successors, (332) [2025-02-05 21:59:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 5290 transitions. [2025-02-05 21:59:40,614 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 5290 transitions. Word has length 642 [2025-02-05 21:59:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:40,614 INFO L471 AbstractCegarLoop]: Abstraction has 3079 states and 5290 transitions. [2025-02-05 21:59:40,615 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 5290 transitions. [2025-02-05 21:59:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 21:59:40,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:40,620 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:40,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:59:40,621 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:40,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2078211575, now seen corresponding path program 1 times [2025-02-05 21:59:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55361308] [2025-02-05 21:59:40,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:40,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:59:40,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:59:40,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:40,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:41,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:41,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55361308] [2025-02-05 21:59:41,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55361308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:41,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:41,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:41,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317981396] [2025-02-05 21:59:41,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:41,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:41,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:41,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:41,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:41,040 INFO L87 Difference]: Start difference. First operand 3079 states and 5290 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:41,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:41,179 INFO L93 Difference]: Finished difference Result 9231 states and 15864 transitions. [2025-02-05 21:59:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:41,180 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 642 [2025-02-05 21:59:41,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:41,204 INFO L225 Difference]: With dead ends: 9231 [2025-02-05 21:59:41,204 INFO L226 Difference]: Without dead ends: 6155 [2025-02-05 21:59:41,212 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-02-05 21:59:41,213 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 304 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:41,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1049 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2025-02-05 21:59:41,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 6153. [2025-02-05 21:59:41,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 5464 states have (on average 1.691800878477306) internal successors, (9244), 5468 states have internal predecessors, (9244), 664 states have call successors, (664), 24 states have call predecessors, (664), 24 states have return successors, (664), 660 states have call predecessors, (664), 664 states have call successors, (664) [2025-02-05 21:59:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 10572 transitions. [2025-02-05 21:59:41,458 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 10572 transitions. Word has length 642 [2025-02-05 21:59:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:41,459 INFO L471 AbstractCegarLoop]: Abstraction has 6153 states and 10572 transitions. [2025-02-05 21:59:41,460 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 10572 transitions. [2025-02-05 21:59:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 21:59:41,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:41,467 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:41,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:59:41,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:41,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash -709203912, now seen corresponding path program 1 times [2025-02-05 21:59:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:41,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999303566] [2025-02-05 21:59:41,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:41,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:41,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 21:59:41,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 21:59:41,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:41,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:41,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:41,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999303566] [2025-02-05 21:59:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999303566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335569703] [2025-02-05 21:59:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:41,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:41,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:41,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:41,849 INFO L87 Difference]: Start difference. First operand 6153 states and 10572 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:42,329 INFO L93 Difference]: Finished difference Result 14766 states and 25465 transitions. [2025-02-05 21:59:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:42,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 642 [2025-02-05 21:59:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:42,360 INFO L225 Difference]: With dead ends: 14766 [2025-02-05 21:59:42,360 INFO L226 Difference]: Without dead ends: 8616 [2025-02-05 21:59:42,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:42,371 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 526 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:42,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1568 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:59:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8616 states. [2025-02-05 21:59:42,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8616 to 8486. [2025-02-05 21:59:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 7694 states have (on average 1.710553678190798) internal successors, (13161), 7698 states have internal predecessors, (13161), 763 states have call successors, (763), 28 states have call predecessors, (763), 28 states have return successors, (763), 759 states have call predecessors, (763), 763 states have call successors, (763) [2025-02-05 21:59:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 14687 transitions. [2025-02-05 21:59:42,732 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 14687 transitions. Word has length 642 [2025-02-05 21:59:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:42,733 INFO L471 AbstractCegarLoop]: Abstraction has 8486 states and 14687 transitions. [2025-02-05 21:59:42,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 14687 transitions. [2025-02-05 21:59:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:59:42,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:42,745 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:42,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:59:42,746 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:42,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:42,746 INFO L85 PathProgramCache]: Analyzing trace with hash -633845358, now seen corresponding path program 1 times [2025-02-05 21:59:42,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135438816] [2025-02-05 21:59:42,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:42,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:42,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:42,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:42,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:42,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135438816] [2025-02-05 21:59:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135438816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:43,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591302338] [2025-02-05 21:59:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:43,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:43,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:43,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:43,465 INFO L87 Difference]: Start difference. First operand 8486 states and 14687 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:44,128 INFO L93 Difference]: Finished difference Result 24882 states and 43202 transitions. [2025-02-05 21:59:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-02-05 21:59:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:44,167 INFO L225 Difference]: With dead ends: 24882 [2025-02-05 21:59:44,168 INFO L226 Difference]: Without dead ends: 16868 [2025-02-05 21:59:44,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:44,189 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 343 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:44,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1329 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:59:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16868 states. [2025-02-05 21:59:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16868 to 16866. [2025-02-05 21:59:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16866 states, 15386 states have (on average 1.700896919277265) internal successors, (26170), 15394 states have internal predecessors, (26170), 1427 states have call successors, (1427), 52 states have call predecessors, (1427), 52 states have return successors, (1427), 1419 states have call predecessors, (1427), 1427 states have call successors, (1427) [2025-02-05 21:59:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16866 states to 16866 states and 29024 transitions. [2025-02-05 21:59:44,722 INFO L78 Accepts]: Start accepts. Automaton has 16866 states and 29024 transitions. Word has length 643 [2025-02-05 21:59:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:44,723 INFO L471 AbstractCegarLoop]: Abstraction has 16866 states and 29024 transitions. [2025-02-05 21:59:44,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 16866 states and 29024 transitions. [2025-02-05 21:59:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:59:44,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:44,733 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:44,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:59:44,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:44,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:44,734 INFO L85 PathProgramCache]: Analyzing trace with hash -195835855, now seen corresponding path program 1 times [2025-02-05 21:59:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:44,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038584090] [2025-02-05 21:59:44,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:44,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:44,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:44,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:44,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:45,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038584090] [2025-02-05 21:59:45,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038584090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:45,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:45,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:45,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979181814] [2025-02-05 21:59:45,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:45,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:45,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:45,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:45,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:45,355 INFO L87 Difference]: Start difference. First operand 16866 states and 29024 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:47,126 INFO L93 Difference]: Finished difference Result 42470 states and 72135 transitions. [2025-02-05 21:59:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:59:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-02-05 21:59:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:47,224 INFO L225 Difference]: With dead ends: 42470 [2025-02-05 21:59:47,224 INFO L226 Difference]: Without dead ends: 29948 [2025-02-05 21:59:47,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:47,265 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 638 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:47,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1682 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:59:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29948 states. [2025-02-05 21:59:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29948 to 24974. [2025-02-05 21:59:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24974 states, 22357 states have (on average 1.7013463344813704) internal successors, (38037), 22381 states have internal predecessors, (38037), 2515 states have call successors, (2515), 101 states have call predecessors, (2515), 101 states have return successors, (2515), 2491 states have call predecessors, (2515), 2515 states have call successors, (2515) [2025-02-05 21:59:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24974 states to 24974 states and 43067 transitions. [2025-02-05 21:59:48,163 INFO L78 Accepts]: Start accepts. Automaton has 24974 states and 43067 transitions. Word has length 643 [2025-02-05 21:59:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:48,164 INFO L471 AbstractCegarLoop]: Abstraction has 24974 states and 43067 transitions. [2025-02-05 21:59:48,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 21:59:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 24974 states and 43067 transitions. [2025-02-05 21:59:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:59:48,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:48,177 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:48,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:59:48,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:48,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash 648636016, now seen corresponding path program 1 times [2025-02-05 21:59:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:48,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250386465] [2025-02-05 21:59:48,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:48,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:48,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:48,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:48,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:49,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:49,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250386465] [2025-02-05 21:59:49,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250386465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:49,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:59:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50783916] [2025-02-05 21:59:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:49,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:59:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:49,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:59:49,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:59:49,536 INFO L87 Difference]: Start difference. First operand 24974 states and 43067 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:59:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:53,303 INFO L93 Difference]: Finished difference Result 90524 states and 155102 transitions. [2025-02-05 21:59:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:59:53,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 643 [2025-02-05 21:59:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:53,518 INFO L225 Difference]: With dead ends: 90524 [2025-02-05 21:59:53,518 INFO L226 Difference]: Without dead ends: 67942 [2025-02-05 21:59:53,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:59:53,578 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 1190 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 2653 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:53,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 2653 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:59:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67942 states. [2025-02-05 21:59:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67942 to 55736. [2025-02-05 21:59:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55736 states, 48559 states have (on average 1.6762289173994522) internal successors, (81396), 48639 states have internal predecessors, (81396), 6883 states have call successors, (6883), 293 states have call predecessors, (6883), 293 states have return successors, (6883), 6803 states have call predecessors, (6883), 6883 states have call successors, (6883) [2025-02-05 21:59:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55736 states to 55736 states and 95162 transitions. [2025-02-05 21:59:55,937 INFO L78 Accepts]: Start accepts. Automaton has 55736 states and 95162 transitions. Word has length 643 [2025-02-05 21:59:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:55,938 INFO L471 AbstractCegarLoop]: Abstraction has 55736 states and 95162 transitions. [2025-02-05 21:59:55,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 2 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-02-05 21:59:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 55736 states and 95162 transitions. [2025-02-05 21:59:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 21:59:55,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:55,963 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 21:59:55,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:59:55,963 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash 252880879, now seen corresponding path program 1 times [2025-02-05 21:59:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159167075] [2025-02-05 21:59:55,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:55,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:56,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:56,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:56,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 33 proven. 261 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-02-05 21:59:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159167075] [2025-02-05 21:59:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159167075] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:59:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035927505] [2025-02-05 21:59:56,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:59:56,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:56,977 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:59:56,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 21:59:57,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 21:59:57,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 21:59:57,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:57,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:57,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 21:59:57,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:59:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 21:59:58,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:59:58,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035927505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:58,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:59:58,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-02-05 21:59:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459472573] [2025-02-05 21:59:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:58,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:59:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:58,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:59:58,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:59:58,113 INFO L87 Difference]: Start difference. First operand 55736 states and 95162 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 22:00:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:00,410 INFO L93 Difference]: Finished difference Result 135009 states and 231534 transitions. [2025-02-05 22:00:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 22:00:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-02-05 22:00:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:00,606 INFO L225 Difference]: With dead ends: 135009 [2025-02-05 22:00:00,606 INFO L226 Difference]: Without dead ends: 79472 [2025-02-05 22:00:00,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:00:00,687 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 1899 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1899 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:00,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1899 Valid, 2187 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:00:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79472 states. [2025-02-05 22:00:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79472 to 58616. [2025-02-05 22:00:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58616 states, 51439 states have (on average 1.6768210890569413) internal successors, (86254), 51519 states have internal predecessors, (86254), 6883 states have call successors, (6883), 293 states have call predecessors, (6883), 293 states have return successors, (6883), 6803 states have call predecessors, (6883), 6883 states have call successors, (6883) [2025-02-05 22:00:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58616 states to 58616 states and 100020 transitions. [2025-02-05 22:00:03,497 INFO L78 Accepts]: Start accepts. Automaton has 58616 states and 100020 transitions. Word has length 643 [2025-02-05 22:00:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:03,498 INFO L471 AbstractCegarLoop]: Abstraction has 58616 states and 100020 transitions. [2025-02-05 22:00:03,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 22:00:03,498 INFO L276 IsEmpty]: Start isEmpty. Operand 58616 states and 100020 transitions. [2025-02-05 22:00:03,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 22:00:03,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:03,532 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:00:03,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:00:03,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 22:00:03,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:03,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash -195815760, now seen corresponding path program 1 times [2025-02-05 22:00:03,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:03,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546127380] [2025-02-05 22:00:03,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:03,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:03,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 22:00:03,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 22:00:03,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:03,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 33 proven. 261 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-02-05 22:00:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546127380] [2025-02-05 22:00:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546127380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:00:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375032652] [2025-02-05 22:00:05,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:05,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:00:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:00:05,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:00:05,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:00:05,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 22:00:05,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 22:00:05,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:05,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:05,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 22:00:05,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:00:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 6140 proven. 237 refuted. 0 times theorem prover too weak. 13027 trivial. 0 not checked. [2025-02-05 22:00:05,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:00:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 57 proven. 237 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-02-05 22:00:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375032652] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:00:06,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:00:06,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-05 22:00:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427616917] [2025-02-05 22:00:06,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:00:06,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:00:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:06,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:00:06,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:00:06,246 INFO L87 Difference]: Start difference. First operand 58616 states and 100020 transitions. Second operand has 11 states, 11 states have (on average 26.90909090909091) internal successors, (296), 11 states have internal predecessors, (296), 3 states have call successors, (265), 2 states have call predecessors, (265), 4 states have return successors, (267), 3 states have call predecessors, (267), 3 states have call successors, (267) [2025-02-05 22:00:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:12,707 INFO L93 Difference]: Finished difference Result 198943 states and 335971 transitions. [2025-02-05 22:00:12,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-02-05 22:00:12,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 26.90909090909091) internal successors, (296), 11 states have internal predecessors, (296), 3 states have call successors, (265), 2 states have call predecessors, (265), 4 states have return successors, (267), 3 states have call predecessors, (267), 3 states have call successors, (267) Word has length 643 [2025-02-05 22:00:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:13,071 INFO L225 Difference]: With dead ends: 198943 [2025-02-05 22:00:13,072 INFO L226 Difference]: Without dead ends: 144941 [2025-02-05 22:00:13,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1328 GetRequests, 1288 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=456, Invalid=1266, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 22:00:13,202 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1653 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:13,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2253 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:00:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144941 states. [2025-02-05 22:00:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144941 to 112289. [2025-02-05 22:00:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112289 states, 100885 states have (on average 1.6587500619517273) internal successors, (167343), 101253 states have internal predecessors, (167343), 10435 states have call successors, (10435), 968 states have call predecessors, (10435), 968 states have return successors, (10435), 10067 states have call predecessors, (10435), 10435 states have call successors, (10435) [2025-02-05 22:00:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112289 states to 112289 states and 188213 transitions. [2025-02-05 22:00:18,872 INFO L78 Accepts]: Start accepts. Automaton has 112289 states and 188213 transitions. Word has length 643 [2025-02-05 22:00:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:18,872 INFO L471 AbstractCegarLoop]: Abstraction has 112289 states and 188213 transitions. [2025-02-05 22:00:18,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.90909090909091) internal successors, (296), 11 states have internal predecessors, (296), 3 states have call successors, (265), 2 states have call predecessors, (265), 4 states have return successors, (267), 3 states have call predecessors, (267), 3 states have call successors, (267) [2025-02-05 22:00:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 112289 states and 188213 transitions. [2025-02-05 22:00:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 22:00:18,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:18,913 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:00:18,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 22:00:19,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:00:19,119 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:19,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1570606678, now seen corresponding path program 1 times [2025-02-05 22:00:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:19,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948762062] [2025-02-05 22:00:19,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:19,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 22:00:19,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 22:00:19,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:19,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 22:00:19,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948762062] [2025-02-05 22:00:19,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948762062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:19,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:19,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:00:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252759789] [2025-02-05 22:00:19,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:19,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:00:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:19,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:00:19,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:00:19,257 INFO L87 Difference]: Start difference. First operand 112289 states and 188213 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 22:00:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:00:26,451 INFO L93 Difference]: Finished difference Result 277257 states and 461098 transitions. [2025-02-05 22:00:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:00:26,451 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-02-05 22:00:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:00:26,895 INFO L225 Difference]: With dead ends: 277257 [2025-02-05 22:00:26,895 INFO L226 Difference]: Without dead ends: 174967 [2025-02-05 22:00:27,066 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-02-05 22:00:27,071 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 296 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:00:27,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1059 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:00:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174967 states. [2025-02-05 22:00:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174967 to 174949. [2025-02-05 22:00:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174949 states, 152520 states have (on average 1.6086152635719906) internal successors, (245346), 153272 states have internal predecessors, (245346), 20499 states have call successors, (20499), 1929 states have call predecessors, (20499), 1929 states have return successors, (20499), 19747 states have call predecessors, (20499), 20499 states have call successors, (20499) [2025-02-05 22:00:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174949 states to 174949 states and 286344 transitions. [2025-02-05 22:00:36,866 INFO L78 Accepts]: Start accepts. Automaton has 174949 states and 286344 transitions. Word has length 643 [2025-02-05 22:00:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:00:36,867 INFO L471 AbstractCegarLoop]: Abstraction has 174949 states and 286344 transitions. [2025-02-05 22:00:36,868 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, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-02-05 22:00:36,868 INFO L276 IsEmpty]: Start isEmpty. Operand 174949 states and 286344 transitions. [2025-02-05 22:00:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 22:00:37,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:00:37,012 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:00:37,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 22:00:37,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:00:37,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:00:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1371050921, now seen corresponding path program 1 times [2025-02-05 22:00:37,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:00:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681593038] [2025-02-05 22:00:37,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:00:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:00:37,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 22:00:37,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 22:00:37,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:00:37,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:00:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-02-05 22:00:37,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:00:37,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681593038] [2025-02-05 22:00:37,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681593038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:00:37,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:00:37,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:00:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294641496] [2025-02-05 22:00:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:00:37,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:00:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:00:37,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:00:37,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:00:37,328 INFO L87 Difference]: Start difference. First operand 174949 states and 286344 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99)