./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f125cc7aacd874cf038c23c1026e9d4800627ec1cff77d2b841e959e87f90682 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:57:49,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:57:49,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:57:49,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:57:49,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:57:49,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:57:49,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:57:49,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:57:49,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:57:49,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:57:49,987 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:57:49,987 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:57:49,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:57:49,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:57:49,988 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:57:49,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:57:49,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:57:49,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:57:49,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:57:49,990 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:57:49,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:57:49,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:57:49,991 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f125cc7aacd874cf038c23c1026e9d4800627ec1cff77d2b841e959e87f90682 [2025-03-08 10:57:50,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:57:50,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:57:50,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:57:50,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:57:50,198 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:57:50,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.i [2025-03-08 10:57:51,282 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090447259/a9c21018659f428d99700cb77c884f1b/FLAGfc64d78b7 [2025-03-08 10:57:51,547 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:57:51,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.i [2025-03-08 10:57:51,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090447259/a9c21018659f428d99700cb77c884f1b/FLAGfc64d78b7 [2025-03-08 10:57:51,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090447259/a9c21018659f428d99700cb77c884f1b [2025-03-08 10:57:51,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:57:51,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:57:51,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:57:51,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:57:51,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:57:51,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51, skipping insertion in model container [2025-03-08 10:57:51,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:57:51,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.i[915,928] [2025-03-08 10:57:51,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:57:51,782 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:57:51,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-4.i[915,928] [2025-03-08 10:57:51,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:57:51,852 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:57:51,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51 WrapperNode [2025-03-08 10:57:51,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:57:51,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:57:51,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:57:51,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:57:51,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,911 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2025-03-08 10:57:51,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:57:51,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:57:51,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:57:51,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:57:51,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,952 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:57:51,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:57:51,987 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:57:51,987 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:57:51,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:57:51,988 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (1/1) ... [2025-03-08 10:57:51,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:57:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:52,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:57:52,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:57:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:57:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:57:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:57:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:57:52,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:57:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:57:52,117 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:57:52,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:57:52,799 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 10:57:52,799 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:57:52,821 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:57:52,824 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:57:52,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:57:52 BoogieIcfgContainer [2025-03-08 10:57:52,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:57:52,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:57:52,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:57:52,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:57:52,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:57:51" (1/3) ... [2025-03-08 10:57:52,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d274fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:57:52, skipping insertion in model container [2025-03-08 10:57:52,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:57:51" (2/3) ... [2025-03-08 10:57:52,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d274fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:57:52, skipping insertion in model container [2025-03-08 10:57:52,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:57:52" (3/3) ... [2025-03-08 10:57:52,831 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-4.i [2025-03-08 10:57:52,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:57:52,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-4.i that has 2 procedures, 215 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:57:52,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:57:52,901 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;@3cbfc0ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:57:52,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:57:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 139 states have (on average 1.525179856115108) internal successors, (212), 140 states have internal predecessors, (212), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 10:57:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 10:57:52,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:52,920 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:57:52,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1072257361, now seen corresponding path program 1 times [2025-03-08 10:57:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198466112] [2025-03-08 10:57:52,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:53,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 10:57:53,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 10:57:53,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:53,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-08 10:57:53,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198466112] [2025-03-08 10:57:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198466112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:57:53,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795267457] [2025-03-08 10:57:53,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:53,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:57:53,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:57:53,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:57:53,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:57:53,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 10:57:53,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 10:57:53,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:53,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:53,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:57:53,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:57:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-03-08 10:57:53,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:57:53,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795267457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:53,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:57:53,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:57:53,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032373883] [2025-03-08 10:57:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:53,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:57:53,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:53,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:57:53,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:57:53,697 INFO L87 Difference]: Start difference. First operand has 215 states, 139 states have (on average 1.525179856115108) internal successors, (212), 140 states have internal predecessors, (212), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:57:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:53,750 INFO L93 Difference]: Finished difference Result 423 states and 782 transitions. [2025-03-08 10:57:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:57:53,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 456 [2025-03-08 10:57:53,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:53,759 INFO L225 Difference]: With dead ends: 423 [2025-03-08 10:57:53,759 INFO L226 Difference]: Without dead ends: 211 [2025-03-08 10:57:53,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:57:53,766 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:53,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-08 10:57:53,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-08 10:57:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 136 states have (on average 1.4779411764705883) internal successors, (201), 136 states have internal predecessors, (201), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 10:57:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 347 transitions. [2025-03-08 10:57:53,818 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 347 transitions. Word has length 456 [2025-03-08 10:57:53,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:53,819 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 347 transitions. [2025-03-08 10:57:53,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:57:53,819 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 347 transitions. [2025-03-08 10:57:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-08 10:57:53,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:53,827 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:57:53,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:57:54,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:57:54,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:54,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:54,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1256206071, now seen corresponding path program 1 times [2025-03-08 10:57:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536102769] [2025-03-08 10:57:54,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:54,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-08 10:57:54,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-08 10:57:54,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:54,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:57:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:54,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536102769] [2025-03-08 10:57:54,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536102769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:54,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:54,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666405192] [2025-03-08 10:57:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:54,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:54,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:54,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:54,438 INFO L87 Difference]: Start difference. First operand 211 states and 347 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:57:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:54,512 INFO L93 Difference]: Finished difference Result 552 states and 911 transitions. [2025-03-08 10:57:54,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:54,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 457 [2025-03-08 10:57:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:54,518 INFO L225 Difference]: With dead ends: 552 [2025-03-08 10:57:54,521 INFO L226 Difference]: Without dead ends: 344 [2025-03-08 10:57:54,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:54,522 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 222 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:54,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 871 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-03-08 10:57:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2025-03-08 10:57:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 234 states have (on average 1.5128205128205128) internal successors, (354), 235 states have internal predecessors, (354), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 10:57:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 562 transitions. [2025-03-08 10:57:54,564 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 562 transitions. Word has length 457 [2025-03-08 10:57:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:54,565 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 562 transitions. [2025-03-08 10:57:54,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:57:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 562 transitions. [2025-03-08 10:57:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-08 10:57:54,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:54,570 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:57:54,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:57:54,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:54,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:54,572 INFO L85 PathProgramCache]: Analyzing trace with hash 807509432, now seen corresponding path program 1 times [2025-03-08 10:57:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:54,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500559935] [2025-03-08 10:57:54,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:54,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:54,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-08 10:57:54,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-08 10:57:54,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:54,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:57:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500559935] [2025-03-08 10:57:54,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500559935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:54,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:54,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:57:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950326601] [2025-03-08 10:57:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:54,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:57:54,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:54,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:57:54,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:54,955 INFO L87 Difference]: Start difference. First operand 341 states and 562 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:57:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:55,020 INFO L93 Difference]: Finished difference Result 871 states and 1443 transitions. [2025-03-08 10:57:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:57:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 457 [2025-03-08 10:57:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:55,028 INFO L225 Difference]: With dead ends: 871 [2025-03-08 10:57:55,028 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 10:57:55,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:57:55,031 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 342 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:55,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 867 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:57:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 10:57:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 341. [2025-03-08 10:57:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 234 states have (on average 1.5042735042735043) internal successors, (352), 235 states have internal predecessors, (352), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 10:57:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 560 transitions. [2025-03-08 10:57:55,081 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 560 transitions. Word has length 457 [2025-03-08 10:57:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:55,082 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 560 transitions. [2025-03-08 10:57:55,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:57:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 560 transitions. [2025-03-08 10:57:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 10:57:55,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:55,086 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:57:55,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:57:55,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:55,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:55,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1536790649, now seen corresponding path program 1 times [2025-03-08 10:57:55,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:55,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220503652] [2025-03-08 10:57:55,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:55,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:55,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 10:57:55,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 10:57:55,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:55,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:57:56,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:56,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220503652] [2025-03-08 10:57:56,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220503652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:56,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:56,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:57:56,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080460773] [2025-03-08 10:57:56,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:56,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:57:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:56,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:57:56,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:57:56,246 INFO L87 Difference]: Start difference. First operand 341 states and 560 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:57:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:57,433 INFO L93 Difference]: Finished difference Result 1518 states and 2490 transitions. [2025-03-08 10:57:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:57:57,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 458 [2025-03-08 10:57:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:57,442 INFO L225 Difference]: With dead ends: 1518 [2025-03-08 10:57:57,442 INFO L226 Difference]: Without dead ends: 1180 [2025-03-08 10:57:57,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:57:57,446 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 792 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:57,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1120 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 10:57:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-03-08 10:57:57,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1167. [2025-03-08 10:57:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 803 states have (on average 1.4956413449564134) internal successors, (1201), 809 states have internal predecessors, (1201), 355 states have call successors, (355), 8 states have call predecessors, (355), 8 states have return successors, (355), 349 states have call predecessors, (355), 355 states have call successors, (355) [2025-03-08 10:57:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1911 transitions. [2025-03-08 10:57:57,572 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1911 transitions. Word has length 458 [2025-03-08 10:57:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:57,573 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1911 transitions. [2025-03-08 10:57:57,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:57:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1911 transitions. [2025-03-08 10:57:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 10:57:57,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:57,576 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:57:57,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:57:57,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:57,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash 755544872, now seen corresponding path program 1 times [2025-03-08 10:57:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:57,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304073349] [2025-03-08 10:57:57,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:57,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:57,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 10:57:57,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 10:57:57,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:57,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:57:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:57:58,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:57:58,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304073349] [2025-03-08 10:57:58,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304073349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:57:58,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:57:58,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:57:58,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561342616] [2025-03-08 10:57:58,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:57:58,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:57:58,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:57:58,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:57:58,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:57:58,150 INFO L87 Difference]: Start difference. First operand 1167 states and 1911 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:57:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:57:59,151 INFO L93 Difference]: Finished difference Result 6829 states and 11175 transitions. [2025-03-08 10:57:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:57:59,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 458 [2025-03-08 10:57:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:57:59,183 INFO L225 Difference]: With dead ends: 6829 [2025-03-08 10:57:59,183 INFO L226 Difference]: Without dead ends: 5665 [2025-03-08 10:57:59,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:57:59,189 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1447 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:57:59,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 1766 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:57:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2025-03-08 10:57:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 4383. [2025-03-08 10:57:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4383 states, 3044 states have (on average 1.4993429697766096) internal successors, (4564), 3072 states have internal predecessors, (4564), 1306 states have call successors, (1306), 32 states have call predecessors, (1306), 32 states have return successors, (1306), 1278 states have call predecessors, (1306), 1306 states have call successors, (1306) [2025-03-08 10:57:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 7176 transitions. [2025-03-08 10:57:59,552 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 7176 transitions. Word has length 458 [2025-03-08 10:57:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:57:59,552 INFO L471 AbstractCegarLoop]: Abstraction has 4383 states and 7176 transitions. [2025-03-08 10:57:59,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:57:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 7176 transitions. [2025-03-08 10:57:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 10:57:59,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:57:59,582 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:57:59,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:57:59,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:57:59,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:57:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2077842425, now seen corresponding path program 1 times [2025-03-08 10:57:59,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:57:59,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830536165] [2025-03-08 10:57:59,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:57:59,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:57:59,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 10:57:59,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 10:57:59,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:57:59,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:58:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830536165] [2025-03-08 10:58:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830536165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:58:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229363550] [2025-03-08 10:58:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:00,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:58:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:00,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:58:00,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:58:00,253 INFO L87 Difference]: Start difference. First operand 4383 states and 7176 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:58:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:00,665 INFO L93 Difference]: Finished difference Result 9535 states and 15407 transitions. [2025-03-08 10:58:00,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:58:00,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 458 [2025-03-08 10:58:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:00,690 INFO L225 Difference]: With dead ends: 9535 [2025-03-08 10:58:00,690 INFO L226 Difference]: Without dead ends: 5155 [2025-03-08 10:58:00,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:58:00,704 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 38 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:00,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 974 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:58:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5155 states. [2025-03-08 10:58:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5155 to 4703. [2025-03-08 10:58:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 3364 states have (on average 1.4994054696789536) internal successors, (5044), 3392 states have internal predecessors, (5044), 1306 states have call successors, (1306), 32 states have call predecessors, (1306), 32 states have return successors, (1306), 1278 states have call predecessors, (1306), 1306 states have call successors, (1306) [2025-03-08 10:58:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 7656 transitions. [2025-03-08 10:58:01,046 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 7656 transitions. Word has length 458 [2025-03-08 10:58:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 4703 states and 7656 transitions. [2025-03-08 10:58:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:58:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 7656 transitions. [2025-03-08 10:58:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 10:58:01,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:01,053 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:58:01,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:58:01,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:01,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2076918904, now seen corresponding path program 1 times [2025-03-08 10:58:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:01,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083127055] [2025-03-08 10:58:01,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:01,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 10:58:01,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 10:58:01,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:01,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:58:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083127055] [2025-03-08 10:58:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083127055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:01,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:01,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:58:01,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662164440] [2025-03-08 10:58:01,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:01,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:58:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:01,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:58:01,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:58:01,788 INFO L87 Difference]: Start difference. First operand 4703 states and 7656 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:58:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:02,446 INFO L93 Difference]: Finished difference Result 9457 states and 15363 transitions. [2025-03-08 10:58:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:58:02,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) Word has length 458 [2025-03-08 10:58:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:02,474 INFO L225 Difference]: With dead ends: 9457 [2025-03-08 10:58:02,474 INFO L226 Difference]: Without dead ends: 4757 [2025-03-08 10:58:02,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:58:02,489 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 529 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:02,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1066 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:58:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2025-03-08 10:58:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4735. [2025-03-08 10:58:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 3388 states have (on average 1.4935064935064934) internal successors, (5060), 3416 states have internal predecessors, (5060), 1306 states have call successors, (1306), 40 states have call predecessors, (1306), 40 states have return successors, (1306), 1278 states have call predecessors, (1306), 1306 states have call successors, (1306) [2025-03-08 10:58:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 7672 transitions. [2025-03-08 10:58:02,867 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 7672 transitions. Word has length 458 [2025-03-08 10:58:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:02,868 INFO L471 AbstractCegarLoop]: Abstraction has 4735 states and 7672 transitions. [2025-03-08 10:58:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 2 states have call predecessors, (73), 2 states have call successors, (73) [2025-03-08 10:58:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 7672 transitions. [2025-03-08 10:58:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 10:58:02,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:02,880 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:58:02,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:58:02,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:02,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1216630993, now seen corresponding path program 1 times [2025-03-08 10:58:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207315849] [2025-03-08 10:58:02,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:02,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:02,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 10:58:03,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 10:58:03,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:03,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:58:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:06,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207315849] [2025-03-08 10:58:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207315849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:06,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:58:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526147228] [2025-03-08 10:58:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:06,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:58:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:06,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:58:06,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:58:06,905 INFO L87 Difference]: Start difference. First operand 4735 states and 7672 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:58:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:09,175 INFO L93 Difference]: Finished difference Result 13749 states and 22058 transitions. [2025-03-08 10:58:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 10:58:09,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 459 [2025-03-08 10:58:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:09,221 INFO L225 Difference]: With dead ends: 13749 [2025-03-08 10:58:09,222 INFO L226 Difference]: Without dead ends: 9017 [2025-03-08 10:58:09,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-08 10:58:09,236 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 461 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:09,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1979 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:58:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2025-03-08 10:58:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 7121. [2025-03-08 10:58:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7121 states, 5696 states have (on average 1.5244030898876404) internal successors, (8683), 5724 states have internal predecessors, (8683), 1379 states have call successors, (1379), 45 states have call predecessors, (1379), 45 states have return successors, (1379), 1351 states have call predecessors, (1379), 1379 states have call successors, (1379) [2025-03-08 10:58:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 11441 transitions. [2025-03-08 10:58:09,629 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 11441 transitions. Word has length 459 [2025-03-08 10:58:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:09,631 INFO L471 AbstractCegarLoop]: Abstraction has 7121 states and 11441 transitions. [2025-03-08 10:58:09,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:58:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 11441 transitions. [2025-03-08 10:58:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 10:58:09,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:09,638 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:58:09,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:58:09,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:09,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:09,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1618299211, now seen corresponding path program 1 times [2025-03-08 10:58:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:09,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117562951] [2025-03-08 10:58:09,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:09,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 10:58:09,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 10:58:09,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:09,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 9 proven. 207 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 10:58:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117562951] [2025-03-08 10:58:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117562951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685041369] [2025-03-08 10:58:10,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:10,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:10,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:10,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:58:10,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:58:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 10:58:10,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 10:58:10,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:10,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:10,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 10:58:10,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 5196 proven. 90 refuted. 0 times theorem prover too weak. 5226 trivial. 0 not checked. [2025-03-08 10:58:10,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 126 proven. 90 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 10:58:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685041369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:58:10,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:58:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2025-03-08 10:58:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395533311] [2025-03-08 10:58:10,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:10,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:58:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:10,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:58:10,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:58:10,925 INFO L87 Difference]: Start difference. First operand 7121 states and 11441 transitions. Second operand has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (174), 3 states have call predecessors, (174), 3 states have call successors, (174) [2025-03-08 10:58:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:11,895 INFO L93 Difference]: Finished difference Result 14005 states and 22186 transitions. [2025-03-08 10:58:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 10:58:11,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (174), 3 states have call predecessors, (174), 3 states have call successors, (174) Word has length 460 [2025-03-08 10:58:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:11,924 INFO L225 Difference]: With dead ends: 14005 [2025-03-08 10:58:11,925 INFO L226 Difference]: Without dead ends: 7305 [2025-03-08 10:58:11,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 916 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2025-03-08 10:58:11,940 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 552 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:11,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 775 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:58:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7305 states. [2025-03-08 10:58:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7305 to 3864. [2025-03-08 10:58:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 2904 states have (on average 1.4517906336088153) internal successors, (4216), 2916 states have internal predecessors, (4216), 891 states have call successors, (891), 68 states have call predecessors, (891), 68 states have return successors, (891), 879 states have call predecessors, (891), 891 states have call successors, (891) [2025-03-08 10:58:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 5998 transitions. [2025-03-08 10:58:12,242 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 5998 transitions. Word has length 460 [2025-03-08 10:58:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:12,243 INFO L471 AbstractCegarLoop]: Abstraction has 3864 states and 5998 transitions. [2025-03-08 10:58:12,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 9 states have internal predecessors, (182), 3 states have call successors, (172), 2 states have call predecessors, (172), 4 states have return successors, (174), 3 states have call predecessors, (174), 3 states have call successors, (174) [2025-03-08 10:58:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 5998 transitions. [2025-03-08 10:58:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 10:58:12,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:12,247 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:58:12,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:58:12,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 10:58:12,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:12,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash -715209482, now seen corresponding path program 1 times [2025-03-08 10:58:12,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266877028] [2025-03-08 10:58:12,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:12,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 10:58:12,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 10:58:12,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:12,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:58:12,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:12,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266877028] [2025-03-08 10:58:12,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266877028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:12,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:12,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:58:12,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022788055] [2025-03-08 10:58:12,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:12,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:58:12,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:12,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:58:12,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:58:12,733 INFO L87 Difference]: Start difference. First operand 3864 states and 5998 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:58:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:13,408 INFO L93 Difference]: Finished difference Result 9234 states and 14318 transitions. [2025-03-08 10:58:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:58:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 460 [2025-03-08 10:58:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:13,430 INFO L225 Difference]: With dead ends: 9234 [2025-03-08 10:58:13,430 INFO L226 Difference]: Without dead ends: 6485 [2025-03-08 10:58:13,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:58:13,439 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 341 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:13,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1448 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:58:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6485 states. [2025-03-08 10:58:13,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6485 to 6467. [2025-03-08 10:58:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6467 states, 4629 states have (on average 1.4264419961114712) internal successors, (6603), 4653 states have internal predecessors, (6603), 1709 states have call successors, (1709), 128 states have call predecessors, (1709), 128 states have return successors, (1709), 1685 states have call predecessors, (1709), 1709 states have call successors, (1709) [2025-03-08 10:58:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6467 states to 6467 states and 10021 transitions. [2025-03-08 10:58:13,930 INFO L78 Accepts]: Start accepts. Automaton has 6467 states and 10021 transitions. Word has length 460 [2025-03-08 10:58:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:13,931 INFO L471 AbstractCegarLoop]: Abstraction has 6467 states and 10021 transitions. [2025-03-08 10:58:13,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:58:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 6467 states and 10021 transitions. [2025-03-08 10:58:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 10:58:13,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:13,937 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:58:13,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:58:13,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1772303351, now seen corresponding path program 1 times [2025-03-08 10:58:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628145398] [2025-03-08 10:58:13,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:13,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 10:58:14,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 10:58:14,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:14,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 81 proven. 135 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 10:58:14,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:14,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628145398] [2025-03-08 10:58:14,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628145398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:14,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864020401] [2025-03-08 10:58:14,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:14,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:14,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:14,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:58:14,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:58:14,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 10:58:15,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 10:58:15,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:15,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:15,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 10:58:15,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 3768 proven. 48 refuted. 0 times theorem prover too weak. 6696 trivial. 0 not checked. [2025-03-08 10:58:15,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 168 proven. 48 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 10:58:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864020401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:58:15,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:58:15,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-08 10:58:15,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547198691] [2025-03-08 10:58:15,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:15,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 10:58:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:15,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 10:58:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-08 10:58:15,959 INFO L87 Difference]: Start difference. First operand 6467 states and 10021 transitions. Second operand has 17 states, 16 states have (on average 12.25) internal successors, (196), 17 states have internal predecessors, (196), 5 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 4 states have call predecessors, (136), 5 states have call successors, (136) [2025-03-08 10:58:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:19,172 INFO L93 Difference]: Finished difference Result 15413 states and 23315 transitions. [2025-03-08 10:58:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 10:58:19,173 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 12.25) internal successors, (196), 17 states have internal predecessors, (196), 5 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 4 states have call predecessors, (136), 5 states have call successors, (136) Word has length 460 [2025-03-08 10:58:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:19,203 INFO L225 Difference]: With dead ends: 15413 [2025-03-08 10:58:19,203 INFO L226 Difference]: Without dead ends: 9279 [2025-03-08 10:58:19,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 918 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=785, Invalid=2295, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 10:58:19,220 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 2610 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 2259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 4017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2259 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:19,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2610 Valid, 1202 Invalid, 4017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2259 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 10:58:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2025-03-08 10:58:19,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 6185. [2025-03-08 10:58:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6185 states, 4378 states have (on average 1.3636363636363635) internal successors, (5970), 4406 states have internal predecessors, (5970), 1637 states have call successors, (1637), 169 states have call predecessors, (1637), 169 states have return successors, (1637), 1609 states have call predecessors, (1637), 1637 states have call successors, (1637) [2025-03-08 10:58:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 9244 transitions. [2025-03-08 10:58:19,975 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 9244 transitions. Word has length 460 [2025-03-08 10:58:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:19,976 INFO L471 AbstractCegarLoop]: Abstraction has 6185 states and 9244 transitions. [2025-03-08 10:58:19,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 12.25) internal successors, (196), 17 states have internal predecessors, (196), 5 states have call successors, (135), 2 states have call predecessors, (135), 4 states have return successors, (136), 4 states have call predecessors, (136), 5 states have call successors, (136) [2025-03-08 10:58:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 9244 transitions. [2025-03-08 10:58:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 10:58:19,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:19,981 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:58:19,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 10:58:20,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:20,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 417476466, now seen corresponding path program 1 times [2025-03-08 10:58:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097348085] [2025-03-08 10:58:20,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:20,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 10:58:20,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 10:58:20,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:20,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 114 proven. 102 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 10:58:20,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:20,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097348085] [2025-03-08 10:58:20,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097348085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:58:20,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954867192] [2025-03-08 10:58:20,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:20,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:20,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:58:20,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:58:20,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 10:58:20,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 10:58:20,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 10:58:20,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:20,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:20,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:58:20,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:58:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 5316 proven. 102 refuted. 0 times theorem prover too weak. 5094 trivial. 0 not checked. [2025-03-08 10:58:20,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:58:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 114 proven. 102 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-03-08 10:58:21,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954867192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:58:21,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:58:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 10:58:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215059672] [2025-03-08 10:58:21,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:58:21,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:58:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:21,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:58:21,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:58:21,254 INFO L87 Difference]: Start difference. First operand 6185 states and 9244 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) [2025-03-08 10:58:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:22,258 INFO L93 Difference]: Finished difference Result 12433 states and 18332 transitions. [2025-03-08 10:58:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:58:22,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) Word has length 461 [2025-03-08 10:58:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:22,287 INFO L225 Difference]: With dead ends: 12433 [2025-03-08 10:58:22,287 INFO L226 Difference]: Without dead ends: 6573 [2025-03-08 10:58:22,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 929 GetRequests, 919 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:58:22,311 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 478 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:22,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 609 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:58:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6573 states. [2025-03-08 10:58:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6573 to 6285. [2025-03-08 10:58:22,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 4453 states have (on average 1.3467325398607681) internal successors, (5997), 4481 states have internal predecessors, (5997), 1637 states have call successors, (1637), 194 states have call predecessors, (1637), 194 states have return successors, (1637), 1609 states have call predecessors, (1637), 1637 states have call successors, (1637) [2025-03-08 10:58:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 9271 transitions. [2025-03-08 10:58:23,011 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 9271 transitions. Word has length 461 [2025-03-08 10:58:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:23,012 INFO L471 AbstractCegarLoop]: Abstraction has 6285 states and 9271 transitions. [2025-03-08 10:58:23,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) [2025-03-08 10:58:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 9271 transitions. [2025-03-08 10:58:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 10:58:23,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:23,015 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:58:23,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 10:58:23,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:58:23,216 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:23,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash 428792593, now seen corresponding path program 1 times [2025-03-08 10:58:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:23,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602408015] [2025-03-08 10:58:23,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:23,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 10:58:23,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 10:58:23,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:23,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:58:23,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:23,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602408015] [2025-03-08 10:58:23,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602408015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:23,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:23,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:58:23,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029595654] [2025-03-08 10:58:23,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:23,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:58:23,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:23,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:58:23,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:58:23,465 INFO L87 Difference]: Start difference. First operand 6285 states and 9271 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:58:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:58:25,339 INFO L93 Difference]: Finished difference Result 21302 states and 31520 transitions. [2025-03-08 10:58:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:58:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 461 [2025-03-08 10:58:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:58:25,380 INFO L225 Difference]: With dead ends: 21302 [2025-03-08 10:58:25,380 INFO L226 Difference]: Without dead ends: 15198 [2025-03-08 10:58:25,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:58:25,393 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 655 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:58:25,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1562 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:58:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15198 states. [2025-03-08 10:58:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15198 to 11550. [2025-03-08 10:58:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11550 states, 8470 states have (on average 1.3689492325855963) internal successors, (11595), 8530 states have internal predecessors, (11595), 2757 states have call successors, (2757), 322 states have call predecessors, (2757), 322 states have return successors, (2757), 2697 states have call predecessors, (2757), 2757 states have call successors, (2757) [2025-03-08 10:58:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11550 states to 11550 states and 17109 transitions. [2025-03-08 10:58:26,565 INFO L78 Accepts]: Start accepts. Automaton has 11550 states and 17109 transitions. Word has length 461 [2025-03-08 10:58:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:58:26,565 INFO L471 AbstractCegarLoop]: Abstraction has 11550 states and 17109 transitions. [2025-03-08 10:58:26,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-03-08 10:58:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 11550 states and 17109 transitions. [2025-03-08 10:58:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 10:58:26,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:58:26,570 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:58:26,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 10:58:26,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:58:26,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:58:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash -45287695, now seen corresponding path program 1 times [2025-03-08 10:58:26,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:58:26,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895016928] [2025-03-08 10:58:26,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:58:26,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:58:26,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 10:58:26,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 10:58:26,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:58:26,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:58:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-03-08 10:58:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:58:38,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895016928] [2025-03-08 10:58:38,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895016928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:58:38,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:58:38,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 10:58:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217501521] [2025-03-08 10:58:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:58:38,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 10:58:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:58:38,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 10:58:38,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:58:38,391 INFO L87 Difference]: Start difference. First operand 11550 states and 17109 transitions. Second operand has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 4 states have call predecessors, (73), 4 states have call successors, (73) [2025-03-08 10:59:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:09,432 INFO L93 Difference]: Finished difference Result 28386 states and 42188 transitions. [2025-03-08 10:59:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 10:59:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 4 states have call predecessors, (73), 4 states have call successors, (73) Word has length 461 [2025-03-08 10:59:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:09,508 INFO L225 Difference]: With dead ends: 28386 [2025-03-08 10:59:09,508 INFO L226 Difference]: Without dead ends: 25640 [2025-03-08 10:59:09,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2025-03-08 10:59:09,523 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 2290 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 1151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2290 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 4643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1151 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:09,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2290 Valid, 2638 Invalid, 4643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1151 Valid, 3492 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2025-03-08 10:59:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25640 states. [2025-03-08 10:59:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25640 to 7328. [2025-03-08 10:59:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7328 states, 5667 states have (on average 1.4116816657843656) internal successors, (8000), 5695 states have internal predecessors, (8000), 1451 states have call successors, (1451), 209 states have call predecessors, (1451), 209 states have return successors, (1451), 1423 states have call predecessors, (1451), 1451 states have call successors, (1451) [2025-03-08 10:59:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7328 states to 7328 states and 10902 transitions. [2025-03-08 10:59:11,009 INFO L78 Accepts]: Start accepts. Automaton has 7328 states and 10902 transitions. Word has length 461 [2025-03-08 10:59:11,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:11,010 INFO L471 AbstractCegarLoop]: Abstraction has 7328 states and 10902 transitions. [2025-03-08 10:59:11,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.1875) internal successors, (99), 16 states have internal predecessors, (99), 4 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 4 states have call predecessors, (73), 4 states have call successors, (73) [2025-03-08 10:59:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 7328 states and 10902 transitions. [2025-03-08 10:59:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 10:59:11,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:11,013 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:11,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:59:11,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1073111610, now seen corresponding path program 1 times [2025-03-08 10:59:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601505447] [2025-03-08 10:59:11,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:11,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 10:59:11,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 10:59:11,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:11,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat