./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 00:05:32,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:05:32,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:05:32,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:05:32,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:05:32,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:05:32,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:05:32,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:05:32,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:05:32,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:05:32,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:05:32,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:05:32,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:05:32,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:05:32,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:05:32,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:05:32,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:05:32,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:05:32,778 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:05:32,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:05:32,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:05:32,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:05:32,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:05:32,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:05:32,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:05:32,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:05:32,778 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-17 00:05:33,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:05:33,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:05:33,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:05:33,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:05:33,012 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:05:33,013 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-17 00:05:34,233 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e2a339f/e570266362a646a7a304ad5626eb9c75/FLAG71b31fd21 [2025-03-17 00:05:34,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:05:34,551 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-17 00:05:34,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e2a339f/e570266362a646a7a304ad5626eb9c75/FLAG71b31fd21 [2025-03-17 00:05:34,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e2a339f/e570266362a646a7a304ad5626eb9c75 [2025-03-17 00:05:34,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:05:34,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:05:34,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:05:34,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:05:34,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:05:34,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:34,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22918c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34, skipping insertion in model container [2025-03-17 00:05:34,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:34,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:05:34,729 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-17 00:05:34,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:05:34,874 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:05:34,883 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-17 00:05:34,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:05:34,949 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:05:34,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34 WrapperNode [2025-03-17 00:05:34,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:05:34,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:05:34,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:05:34,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:05:34,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:34,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,025 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 501 [2025-03-17 00:05:35,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:05:35,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:05:35,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:05:35,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:05:35,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,060 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-17 00:05:35,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:05:35,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:05:35,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:05:35,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:05:35,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (1/1) ... [2025-03-17 00:05:35,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:05:35,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:05:35,136 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-17 00:05:35,139 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-17 00:05:35,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:05:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:05:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:05:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:05:35,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:05:35,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:05:35,246 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:05:35,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:05:35,928 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 00:05:35,929 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:05:35,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:05:35,954 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:05:35,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:05:35 BoogieIcfgContainer [2025-03-17 00:05:35,955 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:05:35,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:05:35,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:05:35,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:05:35,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:05:34" (1/3) ... [2025-03-17 00:05:35,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c73403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:05:35, skipping insertion in model container [2025-03-17 00:05:35,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:05:34" (2/3) ... [2025-03-17 00:05:35,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c73403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:05:35, skipping insertion in model container [2025-03-17 00:05:35,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:05:35" (3/3) ... [2025-03-17 00:05:35,963 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-4.i [2025-03-17 00:05:35,973 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:05:35,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-4.i that has 2 procedures, 210 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:05:36,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:05:36,028 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;@3f860513, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:05:36,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:05:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 134 states have (on average 1.544776119402985) internal successors, (207), 135 states have internal predecessors, (207), 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-17 00:05:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-03-17 00:05:36,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:36,055 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] [2025-03-17 00:05:36,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:36,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1524721967, now seen corresponding path program 1 times [2025-03-17 00:05:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:36,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486812560] [2025-03-17 00:05:36,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:36,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 00:05:36,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 00:05:36,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:36,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:36,551 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-17 00:05:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486812560] [2025-03-17 00:05:36,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486812560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:05:36,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302573586] [2025-03-17 00:05:36,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:36,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:05:36,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:05:36,556 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-17 00:05:36,558 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-17 00:05:36,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-03-17 00:05:36,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-03-17 00:05:36,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:36,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:36,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:05:36,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:05:36,927 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-17 00:05:36,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:05:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302573586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:36,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:05:36,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:05:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039259086] [2025-03-17 00:05:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:36,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:05:36,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:36,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:05:36,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:05:36,952 INFO L87 Difference]: Start difference. First operand has 210 states, 134 states have (on average 1.544776119402985) internal successors, (207), 135 states have internal predecessors, (207), 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 46.0) internal successors, (92), 2 states have internal predecessors, (92), 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-17 00:05:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:37,003 INFO L93 Difference]: Finished difference Result 416 states and 775 transitions. [2025-03-17 00:05:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:05:37,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 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 452 [2025-03-17 00:05:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:37,012 INFO L225 Difference]: With dead ends: 416 [2025-03-17 00:05:37,012 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 00:05:37,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 453 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-17 00:05:37,018 INFO L435 NwaCegarLoop]: 337 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, 337 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-17 00:05:37,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:05:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 00:05:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-17 00:05:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 132 states have (on average 1.4924242424242424) internal successors, (197), 132 states have internal predecessors, (197), 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-17 00:05:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2025-03-17 00:05:37,080 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 452 [2025-03-17 00:05:37,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:37,081 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2025-03-17 00:05:37,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 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-17 00:05:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2025-03-17 00:05:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:05:37,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:37,092 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] [2025-03-17 00:05:37,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:05:37,293 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-17 00:05:37,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:37,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1856018640, now seen corresponding path program 1 times [2025-03-17 00:05:37,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:37,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49746836] [2025-03-17 00:05:37,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:37,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:05:37,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:05:37,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:37,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:37,773 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-17 00:05:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49746836] [2025-03-17 00:05:37,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49746836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:37,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:37,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:05:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691418083] [2025-03-17 00:05:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:37,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:05:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:37,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:05:37,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:05:37,780 INFO L87 Difference]: Start difference. First operand 207 states and 343 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-17 00:05:37,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:37,881 INFO L93 Difference]: Finished difference Result 544 states and 903 transitions. [2025-03-17 00:05:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:05:37,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 453 [2025-03-17 00:05:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:37,888 INFO L225 Difference]: With dead ends: 544 [2025-03-17 00:05:37,888 INFO L226 Difference]: Without dead ends: 338 [2025-03-17 00:05:37,890 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-17 00:05:37,890 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 220 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 861 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:05:37,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 861 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:05:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-17 00:05:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 335. [2025-03-17 00:05:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 228 states have (on average 1.5263157894736843) internal successors, (348), 229 states have internal predecessors, (348), 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-17 00:05:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 556 transitions. [2025-03-17 00:05:37,945 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 556 transitions. Word has length 453 [2025-03-17 00:05:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:37,948 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 556 transitions. [2025-03-17 00:05:37,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-17 00:05:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 556 transitions. [2025-03-17 00:05:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-17 00:05:37,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:37,954 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] [2025-03-17 00:05:37,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:05:37,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:37,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1980091887, now seen corresponding path program 1 times [2025-03-17 00:05:37,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:37,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560259302] [2025-03-17 00:05:37,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:37,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:38,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-17 00:05:38,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-17 00:05:38,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:38,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:38,474 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-17 00:05:38,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:38,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560259302] [2025-03-17 00:05:38,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560259302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:38,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:05:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730383497] [2025-03-17 00:05:38,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:38,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:05:38,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:38,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:05:38,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:05:38,479 INFO L87 Difference]: Start difference. First operand 335 states and 556 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-17 00:05:38,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:38,567 INFO L93 Difference]: Finished difference Result 860 states and 1432 transitions. [2025-03-17 00:05:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:05:38,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 453 [2025-03-17 00:05:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:38,577 INFO L225 Difference]: With dead ends: 860 [2025-03-17 00:05:38,577 INFO L226 Difference]: Without dead ends: 526 [2025-03-17 00:05:38,579 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-17 00:05:38,580 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 340 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 859 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-17 00:05:38,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 859 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:05:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-17 00:05:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 335. [2025-03-17 00:05:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 228 states have (on average 1.5175438596491229) internal successors, (346), 229 states have internal predecessors, (346), 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-17 00:05:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 554 transitions. [2025-03-17 00:05:38,642 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 554 transitions. Word has length 453 [2025-03-17 00:05:38,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:38,644 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 554 transitions. [2025-03-17 00:05:38,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-17 00:05:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 554 transitions. [2025-03-17 00:05:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 00:05:38,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:38,648 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] [2025-03-17 00:05:38,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:05:38,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:38,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1471951769, now seen corresponding path program 1 times [2025-03-17 00:05:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911892959] [2025-03-17 00:05:38,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:38,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:05:38,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:05:38,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:38,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:38,942 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-17 00:05:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:38,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911892959] [2025-03-17 00:05:38,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911892959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:38,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:38,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:05:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087866779] [2025-03-17 00:05:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:38,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:05:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:38,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:05:38,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:05:38,945 INFO L87 Difference]: Start difference. First operand 335 states and 554 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-17 00:05:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:39,018 INFO L93 Difference]: Finished difference Result 1003 states and 1660 transitions. [2025-03-17 00:05:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:05:39,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 454 [2025-03-17 00:05:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:39,026 INFO L225 Difference]: With dead ends: 1003 [2025-03-17 00:05:39,027 INFO L226 Difference]: Without dead ends: 669 [2025-03-17 00:05:39,028 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-17 00:05:39,029 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 200 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:05:39,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 729 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:05:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-17 00:05:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 667. [2025-03-17 00:05:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 454 states have (on average 1.5154185022026432) internal successors, (688), 456 states have internal predecessors, (688), 208 states have call successors, (208), 4 states have call predecessors, (208), 4 states have return successors, (208), 206 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-17 00:05:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1104 transitions. [2025-03-17 00:05:39,101 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1104 transitions. Word has length 454 [2025-03-17 00:05:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:39,102 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 1104 transitions. [2025-03-17 00:05:39,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-17 00:05:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1104 transitions. [2025-03-17 00:05:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 00:05:39,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:39,106 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] [2025-03-17 00:05:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:05:39,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:39,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -253529128, now seen corresponding path program 1 times [2025-03-17 00:05:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:39,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849796257] [2025-03-17 00:05:39,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:39,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:05:39,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:05:39,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:39,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:40,469 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-17 00:05:40,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:40,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849796257] [2025-03-17 00:05:40,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849796257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:40,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:40,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:05:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012802147] [2025-03-17 00:05:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:40,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:05:40,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:40,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:05:40,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:05:40,474 INFO L87 Difference]: Start difference. First operand 667 states and 1104 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-17 00:05:41,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:41,850 INFO L93 Difference]: Finished difference Result 2981 states and 4920 transitions. [2025-03-17 00:05:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:05:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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 454 [2025-03-17 00:05:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:41,864 INFO L225 Difference]: With dead ends: 2981 [2025-03-17 00:05:41,864 INFO L226 Difference]: Without dead ends: 2315 [2025-03-17 00:05:41,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:05:41,869 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 615 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:05:41,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1364 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:05:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2025-03-17 00:05:42,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2295. [2025-03-17 00:05:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 1568 states have (on average 1.5025510204081634) internal successors, (2356), 1580 states have internal predecessors, (2356), 710 states have call successors, (710), 16 states have call predecessors, (710), 16 states have return successors, (710), 698 states have call predecessors, (710), 710 states have call successors, (710) [2025-03-17 00:05:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3776 transitions. [2025-03-17 00:05:42,154 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 3776 transitions. Word has length 454 [2025-03-17 00:05:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:42,155 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 3776 transitions. [2025-03-17 00:05:42,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 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-17 00:05:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 3776 transitions. [2025-03-17 00:05:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 00:05:42,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:42,162 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] [2025-03-17 00:05:42,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:05:42,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:42,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash -318130153, now seen corresponding path program 1 times [2025-03-17 00:05:42,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:42,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413340409] [2025-03-17 00:05:42,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:42,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:42,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:05:42,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:05:42,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:42,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:42,811 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-17 00:05:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413340409] [2025-03-17 00:05:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413340409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:05:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735204638] [2025-03-17 00:05:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:42,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:05:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:42,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:05:42,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:05:42,813 INFO L87 Difference]: Start difference. First operand 2295 states and 3776 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-17 00:05:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:44,259 INFO L93 Difference]: Finished difference Result 8896 states and 14633 transitions. [2025-03-17 00:05:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:05:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 454 [2025-03-17 00:05:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:44,320 INFO L225 Difference]: With dead ends: 8896 [2025-03-17 00:05:44,321 INFO L226 Difference]: Without dead ends: 7748 [2025-03-17 00:05:44,330 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-17 00:05:44,332 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 1291 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:05:44,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 1809 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:05:44,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2025-03-17 00:05:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 4317. [2025-03-17 00:05:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 2978 states have (on average 1.5104096709200805) internal successors, (4498), 3006 states have internal predecessors, (4498), 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-17 00:05:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 7110 transitions. [2025-03-17 00:05:44,863 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 7110 transitions. Word has length 454 [2025-03-17 00:05:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:44,864 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 7110 transitions. [2025-03-17 00:05:44,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-17 00:05:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 7110 transitions. [2025-03-17 00:05:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 00:05:44,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:44,871 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] [2025-03-17 00:05:44,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:05:44,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:44,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1240813736, now seen corresponding path program 1 times [2025-03-17 00:05:44,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:44,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138012438] [2025-03-17 00:05:44,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:44,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:44,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:05:45,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:05:45,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:45,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:45,756 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-17 00:05:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:45,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138012438] [2025-03-17 00:05:45,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138012438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:45,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:45,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:05:45,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97034680] [2025-03-17 00:05:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:45,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:05:45,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:45,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:05:45,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:05:45,759 INFO L87 Difference]: Start difference. First operand 4317 states and 7110 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-17 00:05:46,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:46,234 INFO L93 Difference]: Finished difference Result 9277 states and 15149 transitions. [2025-03-17 00:05:46,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:05:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 454 [2025-03-17 00:05:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:46,276 INFO L225 Difference]: With dead ends: 9277 [2025-03-17 00:05:46,277 INFO L226 Difference]: Without dead ends: 4961 [2025-03-17 00:05:46,295 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-17 00:05:46,296 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 21 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:05:46,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1281 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:05:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4961 states. [2025-03-17 00:05:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4961 to 4637. [2025-03-17 00:05:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4637 states, 3298 states have (on average 1.509399636143117) internal successors, (4978), 3326 states have internal predecessors, (4978), 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-17 00:05:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 7590 transitions. [2025-03-17 00:05:46,806 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 7590 transitions. Word has length 454 [2025-03-17 00:05:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:46,807 INFO L471 AbstractCegarLoop]: Abstraction has 4637 states and 7590 transitions. [2025-03-17 00:05:46,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-17 00:05:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 7590 transitions. [2025-03-17 00:05:46,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-17 00:05:46,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:46,815 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] [2025-03-17 00:05:46,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:05:46,815 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:46,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:46,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1240783945, now seen corresponding path program 1 times [2025-03-17 00:05:46,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:46,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043039719] [2025-03-17 00:05:46,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:46,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:46,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-17 00:05:46,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-17 00:05:46,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:46,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:47,591 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-17 00:05:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043039719] [2025-03-17 00:05:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043039719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:05:47,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934378431] [2025-03-17 00:05:47,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:05:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:47,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:05:47,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:05:47,593 INFO L87 Difference]: Start difference. First operand 4637 states and 7590 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-17 00:05:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:05:48,192 INFO L93 Difference]: Finished difference Result 9327 states and 15233 transitions. [2025-03-17 00:05:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:05:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 454 [2025-03-17 00:05:48,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:05:48,230 INFO L225 Difference]: With dead ends: 9327 [2025-03-17 00:05:48,230 INFO L226 Difference]: Without dead ends: 4691 [2025-03-17 00:05:48,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-17 00:05:48,246 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 410 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:05:48,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1165 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:05:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2025-03-17 00:05:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4669. [2025-03-17 00:05:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4669 states, 3322 states have (on average 1.5033112582781456) internal successors, (4994), 3350 states have internal predecessors, (4994), 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-17 00:05:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4669 states to 4669 states and 7606 transitions. [2025-03-17 00:05:48,623 INFO L78 Accepts]: Start accepts. Automaton has 4669 states and 7606 transitions. Word has length 454 [2025-03-17 00:05:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:48,625 INFO L471 AbstractCegarLoop]: Abstraction has 4669 states and 7606 transitions. [2025-03-17 00:05:48,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-17 00:05:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 4669 states and 7606 transitions. [2025-03-17 00:05:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 00:05:48,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:48,635 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] [2025-03-17 00:05:48,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:05:48,635 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:48,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash -752129707, now seen corresponding path program 1 times [2025-03-17 00:05:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:48,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357460691] [2025-03-17 00:05:48,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:48,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 00:05:48,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 00:05:48,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:48,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:57,537 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-17 00:05:57,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357460691] [2025-03-17 00:05:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357460691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:05:57,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:05:57,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:05:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325251004] [2025-03-17 00:05:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:05:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:05:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:57,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:05:57,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:05:57,541 INFO L87 Difference]: Start difference. First operand 4669 states and 7606 transitions. Second operand has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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-17 00:06:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:11,791 INFO L93 Difference]: Finished difference Result 15361 states and 24726 transitions. [2025-03-17 00:06:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:06:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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 455 [2025-03-17 00:06:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:11,846 INFO L225 Difference]: With dead ends: 15361 [2025-03-17 00:06:11,846 INFO L226 Difference]: Without dead ends: 10693 [2025-03-17 00:06:11,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-03-17 00:06:11,869 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 3084 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 1500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3084 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 4827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1500 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:11,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3084 Valid, 2291 Invalid, 4827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1500 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2025-03-17 00:06:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2025-03-17 00:06:12,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 3626. [2025-03-17 00:06:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 2566 states have (on average 1.4809041309431021) internal successors, (3800), 2588 states have internal predecessors, (3800), 1004 states have call successors, (1004), 55 states have call predecessors, (1004), 55 states have return successors, (1004), 982 states have call predecessors, (1004), 1004 states have call successors, (1004) [2025-03-17 00:06:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 5808 transitions. [2025-03-17 00:06:12,579 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 5808 transitions. Word has length 455 [2025-03-17 00:06:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:12,580 INFO L471 AbstractCegarLoop]: Abstraction has 3626 states and 5808 transitions. [2025-03-17 00:06:12,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.642857142857143) internal successors, (93), 14 states have internal predecessors, (93), 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-17 00:06:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 5808 transitions. [2025-03-17 00:06:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 00:06:12,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:12,591 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] [2025-03-17 00:06:12,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:06:12,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:12,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:12,592 INFO L85 PathProgramCache]: Analyzing trace with hash -540778794, now seen corresponding path program 1 times [2025-03-17 00:06:12,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:12,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241662382] [2025-03-17 00:06:12,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:12,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 00:06:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 00:06:12,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:12,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:16,582 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-17 00:06:16,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:16,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241662382] [2025-03-17 00:06:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241662382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:16,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:16,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:06:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657502192] [2025-03-17 00:06:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:16,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:06:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:16,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:06:16,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:06:16,585 INFO L87 Difference]: Start difference. First operand 3626 states and 5808 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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-17 00:06:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:18,734 INFO L93 Difference]: Finished difference Result 10720 states and 17105 transitions. [2025-03-17 00:06:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:06:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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 455 [2025-03-17 00:06:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:18,761 INFO L225 Difference]: With dead ends: 10720 [2025-03-17 00:06:18,761 INFO L226 Difference]: Without dead ends: 7095 [2025-03-17 00:06:18,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:06:18,774 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 434 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:18,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1945 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:06:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2025-03-17 00:06:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 5575. [2025-03-17 00:06:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 4435 states have (on average 1.5251409244644871) internal successors, (6764), 4457 states have internal predecessors, (6764), 1077 states have call successors, (1077), 62 states have call predecessors, (1077), 62 states have return successors, (1077), 1055 states have call predecessors, (1077), 1077 states have call successors, (1077) [2025-03-17 00:06:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 8918 transitions. [2025-03-17 00:06:19,581 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 8918 transitions. Word has length 455 [2025-03-17 00:06:19,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:19,582 INFO L471 AbstractCegarLoop]: Abstraction has 5575 states and 8918 transitions. [2025-03-17 00:06:19,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 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-17 00:06:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 8918 transitions. [2025-03-17 00:06:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-17 00:06:19,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:19,588 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] [2025-03-17 00:06:19,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:06:19,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:19,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1957237143, now seen corresponding path program 1 times [2025-03-17 00:06:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:19,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104028852] [2025-03-17 00:06:19,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:19,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-17 00:06:19,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-17 00:06:19,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:19,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:19,867 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-17 00:06:19,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:19,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104028852] [2025-03-17 00:06:19,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104028852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:19,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:19,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:19,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923684909] [2025-03-17 00:06:19,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:19,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:19,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:19,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:19,869 INFO L87 Difference]: Start difference. First operand 5575 states and 8918 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-17 00:06:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:21,157 INFO L93 Difference]: Finished difference Result 12873 states and 20580 transitions. [2025-03-17 00:06:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 455 [2025-03-17 00:06:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:21,189 INFO L225 Difference]: With dead ends: 12873 [2025-03-17 00:06:21,189 INFO L226 Difference]: Without dead ends: 9080 [2025-03-17 00:06:21,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:21,202 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 185 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:21,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 667 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9080 states. [2025-03-17 00:06:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9080 to 9078. [2025-03-17 00:06:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9078 states, 6879 states have (on average 1.5005087948829772) internal successors, (10322), 6923 states have internal predecessors, (10322), 2081 states have call successors, (2081), 117 states have call predecessors, (2081), 117 states have return successors, (2081), 2037 states have call predecessors, (2081), 2081 states have call successors, (2081) [2025-03-17 00:06:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9078 states to 9078 states and 14484 transitions. [2025-03-17 00:06:22,451 INFO L78 Accepts]: Start accepts. Automaton has 9078 states and 14484 transitions. Word has length 455 [2025-03-17 00:06:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:22,452 INFO L471 AbstractCegarLoop]: Abstraction has 9078 states and 14484 transitions. [2025-03-17 00:06:22,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-17 00:06:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9078 states and 14484 transitions. [2025-03-17 00:06:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 00:06:22,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:22,458 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-17 00:06:22,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:06:22,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:22,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:22,460 INFO L85 PathProgramCache]: Analyzing trace with hash 809460333, now seen corresponding path program 1 times [2025-03-17 00:06:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:22,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761527545] [2025-03-17 00:06:22,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:22,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 00:06:22,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 00:06:22,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:22,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:22,890 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-17 00:06:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761527545] [2025-03-17 00:06:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761527545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:22,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598917934] [2025-03-17 00:06:22,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:22,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:22,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:22,897 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-17 00:06:22,899 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-17 00:06:23,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 00:06:23,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 00:06:23,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:23,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:23,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 00:06:23,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:23,398 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-17 00:06:23,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:24,140 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-17 00:06:24,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598917934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:24,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:24,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-03-17 00:06:24,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910654884] [2025-03-17 00:06:24,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:24,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:06:24,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:24,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:06:24,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:06:24,143 INFO L87 Difference]: Start difference. First operand 9078 states and 14484 transitions. Second operand has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 4 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (160), 4 states have call predecessors, (160), 4 states have call successors, (160) [2025-03-17 00:06:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:29,174 INFO L93 Difference]: Finished difference Result 28904 states and 44915 transitions. [2025-03-17 00:06:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 00:06:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 4 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (160), 4 states have call predecessors, (160), 4 states have call successors, (160) Word has length 456 [2025-03-17 00:06:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:29,249 INFO L225 Difference]: With dead ends: 28904 [2025-03-17 00:06:29,250 INFO L226 Difference]: Without dead ends: 20540 [2025-03-17 00:06:29,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=382, Invalid=1024, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 00:06:29,278 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1176 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 1122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1122 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:29,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1041 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1122 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:06:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20540 states. [2025-03-17 00:06:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20540 to 7178. [2025-03-17 00:06:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7178 states, 5673 states have (on average 1.5089018156178389) internal successors, (8560), 5701 states have internal predecessors, (8560), 1379 states have call successors, (1379), 125 states have call predecessors, (1379), 125 states have return successors, (1379), 1351 states have call predecessors, (1379), 1379 states have call successors, (1379) [2025-03-17 00:06:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7178 states to 7178 states and 11318 transitions. [2025-03-17 00:06:30,862 INFO L78 Accepts]: Start accepts. Automaton has 7178 states and 11318 transitions. Word has length 456 [2025-03-17 00:06:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:30,863 INFO L471 AbstractCegarLoop]: Abstraction has 7178 states and 11318 transitions. [2025-03-17 00:06:30,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.46153846153846) internal successors, (214), 13 states have internal predecessors, (214), 4 states have call successors, (158), 2 states have call predecessors, (158), 4 states have return successors, (160), 4 states have call predecessors, (160), 4 states have call successors, (160) [2025-03-17 00:06:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 7178 states and 11318 transitions. [2025-03-17 00:06:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 00:06:30,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:30,868 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-17 00:06:30,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:06:31,068 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,SelfDestructingSolverStorable11 [2025-03-17 00:06:31,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:31,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1048547185, now seen corresponding path program 1 times [2025-03-17 00:06:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406247021] [2025-03-17 00:06:31,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:31,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:31,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 00:06:31,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 00:06:31,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:31,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:31,170 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-17 00:06:31,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:31,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406247021] [2025-03-17 00:06:31,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406247021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:31,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:31,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056861049] [2025-03-17 00:06:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:31,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:31,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:31,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:31,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:31,173 INFO L87 Difference]: Start difference. First operand 7178 states and 11318 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-17 00:06:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:33,209 INFO L93 Difference]: Finished difference Result 16041 states and 25346 transitions. [2025-03-17 00:06:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:33,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 456 [2025-03-17 00:06:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:33,247 INFO L225 Difference]: With dead ends: 16041 [2025-03-17 00:06:33,248 INFO L226 Difference]: Without dead ends: 14059 [2025-03-17 00:06:33,256 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-17 00:06:33,256 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 322 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:33,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 647 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:33,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14059 states. [2025-03-17 00:06:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14059 to 14057. [2025-03-17 00:06:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14057 states, 11130 states have (on average 1.5056603773584907) internal successors, (16758), 11186 states have internal predecessors, (16758), 2685 states have call successors, (2685), 241 states have call predecessors, (2685), 241 states have return successors, (2685), 2629 states have call predecessors, (2685), 2685 states have call successors, (2685) [2025-03-17 00:06:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14057 states to 14057 states and 22128 transitions. [2025-03-17 00:06:35,415 INFO L78 Accepts]: Start accepts. Automaton has 14057 states and 22128 transitions. Word has length 456 [2025-03-17 00:06:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:35,416 INFO L471 AbstractCegarLoop]: Abstraction has 14057 states and 22128 transitions. [2025-03-17 00:06:35,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-17 00:06:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 14057 states and 22128 transitions. [2025-03-17 00:06:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-17 00:06:35,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:35,424 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-17 00:06:35,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:06:35,425 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:35,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash -431103667, now seen corresponding path program 1 times [2025-03-17 00:06:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:35,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750742842] [2025-03-17 00:06:35,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:35,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:35,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-17 00:06:35,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-17 00:06:35,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:35,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:39,323 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-17 00:06:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:39,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750742842] [2025-03-17 00:06:39,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750742842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:39,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:39,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 00:06:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848956997] [2025-03-17 00:06:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:39,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 00:06:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:39,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 00:06:39,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 00:06:39,325 INFO L87 Difference]: Start difference. First operand 14057 states and 22128 transitions. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 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)