./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-73.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 076046e86d20a5ef1734fc8e29c600eeeaad5a6d7202972e85f4fad8625f4845 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:01:51,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:01:51,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:01:51,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:01:51,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:01:51,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:01:51,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:01:51,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:01:51,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:01:51,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:01:51,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:01:51,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:01:51,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:01:51,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:01:51,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:01:51,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:01:51,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:01:51,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:01:51,535 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 -> 076046e86d20a5ef1734fc8e29c600eeeaad5a6d7202972e85f4fad8625f4845 [2025-03-08 11:01:51,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:01:51,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:01:51,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:01:51,837 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:01:51,838 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:01:51,839 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-73.i [2025-03-08 11:01:53,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a856adc/0e91570c66a84bb39f3a3b0d719a9635/FLAG2a5d30a09 [2025-03-08 11:01:53,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:01:53,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-73.i [2025-03-08 11:01:53,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a856adc/0e91570c66a84bb39f3a3b0d719a9635/FLAG2a5d30a09 [2025-03-08 11:01:53,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a856adc/0e91570c66a84bb39f3a3b0d719a9635 [2025-03-08 11:01:53,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:01:53,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:01:53,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:01:53,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:01:53,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:01:53,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:01:53" (1/1) ... [2025-03-08 11:01:53,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4308fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:53, skipping insertion in model container [2025-03-08 11:01:53,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:01:53" (1/1) ... [2025-03-08 11:01:53,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:01:53,863 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-73.i[916,929] [2025-03-08 11:01:53,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:01:54,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:01:54,021 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-73.i[916,929] [2025-03-08 11:01:54,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:01:54,086 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:01:54,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54 WrapperNode [2025-03-08 11:01:54,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:01:54,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:01:54,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:01:54,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:01:54,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,162 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 542 [2025-03-08 11:01:54,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:01:54,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:01:54,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:01:54,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:01:54,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,215 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:01:54,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:01:54,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:01:54,261 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:01:54,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:01:54,262 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (1/1) ... [2025-03-08 11:01:54,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:01:54,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:01:54,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:01:54,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:01:54,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:01:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:01:54,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:01:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:01:54,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:01:54,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:01:54,440 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:01:54,442 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:01:55,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L459: havoc property_#t~bitwise52#1;havoc property_#t~short53#1; [2025-03-08 11:01:55,172 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 11:01:55,173 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:01:55,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:01:55,204 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:01:55,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:01:55 BoogieIcfgContainer [2025-03-08 11:01:55,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:01:55,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:01:55,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:01:55,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:01:55,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:01:53" (1/3) ... [2025-03-08 11:01:55,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59228259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:01:55, skipping insertion in model container [2025-03-08 11:01:55,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:01:54" (2/3) ... [2025-03-08 11:01:55,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59228259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:01:55, skipping insertion in model container [2025-03-08 11:01:55,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:01:55" (3/3) ... [2025-03-08 11:01:55,211 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-73.i [2025-03-08 11:01:55,223 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:01:55,226 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-73.i that has 2 procedures, 225 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:01:55,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:01:55,291 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;@609b9425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:01:55,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:01:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 11:01:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-08 11:01:55,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:55,316 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:55,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:55,322 INFO L85 PathProgramCache]: Analyzing trace with hash -447459036, now seen corresponding path program 1 times [2025-03-08 11:01:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:55,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255282399] [2025-03-08 11:01:55,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:55,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-08 11:01:55,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-08 11:01:55,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:55,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-03-08 11:01:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255282399] [2025-03-08 11:01:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255282399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:01:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287506842] [2025-03-08 11:01:55,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:55,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:01:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:01:55,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:01:55,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:01:56,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-08 11:01:56,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-08 11:01:56,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:56,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:56,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:01:56,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:01:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-03-08 11:01:56,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:01:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287506842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:01:56,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:01:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740324594] [2025-03-08 11:01:56,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:56,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:01:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:56,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:01:56,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:01:56,406 INFO L87 Difference]: Start difference. First operand has 225 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-08 11:01:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:56,491 INFO L93 Difference]: Finished difference Result 444 states and 808 transitions. [2025-03-08 11:01:56,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:01:56,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) Word has length 446 [2025-03-08 11:01:56,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:56,505 INFO L225 Difference]: With dead ends: 444 [2025-03-08 11:01:56,506 INFO L226 Difference]: Without dead ends: 222 [2025-03-08 11:01:56,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:01:56,517 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:56,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:01:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-08 11:01:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-08 11:01:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 151 states have internal predecessors, (229), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 11:01:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 367 transitions. [2025-03-08 11:01:56,591 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 367 transitions. Word has length 446 [2025-03-08 11:01:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:56,591 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 367 transitions. [2025-03-08 11:01:56,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-08 11:01:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 367 transitions. [2025-03-08 11:01:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-08 11:01:56,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:56,602 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:56,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:01:56,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:01:56,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2139019019, now seen corresponding path program 1 times [2025-03-08 11:01:56,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:56,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632011190] [2025-03-08 11:01:56,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:56,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-08 11:01:56,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-08 11:01:56,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:56,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-08 11:01:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632011190] [2025-03-08 11:01:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632011190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:57,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:01:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911170063] [2025-03-08 11:01:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:57,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:01:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:57,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:01:57,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:01:57,192 INFO L87 Difference]: Start difference. First operand 222 states and 367 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-08 11:01:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:57,309 INFO L93 Difference]: Finished difference Result 582 states and 962 transitions. [2025-03-08 11:01:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:01:57,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 446 [2025-03-08 11:01:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:57,315 INFO L225 Difference]: With dead ends: 582 [2025-03-08 11:01:57,315 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 11:01:57,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:01:57,319 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 242 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:57,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 773 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:01:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 11:01:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 360. [2025-03-08 11:01:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 248 states have (on average 1.4959677419354838) internal successors, (371), 249 states have internal predecessors, (371), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-08 11:01:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 589 transitions. [2025-03-08 11:01:57,374 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 589 transitions. Word has length 446 [2025-03-08 11:01:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:57,375 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 589 transitions. [2025-03-08 11:01:57,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-08 11:01:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 589 transitions. [2025-03-08 11:01:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-08 11:01:57,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:57,381 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:57,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:01:57,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:57,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1082384567, now seen corresponding path program 1 times [2025-03-08 11:01:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852548208] [2025-03-08 11:01:57,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:57,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-08 11:01:57,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-08 11:01:57,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:57,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-08 11:01:57,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852548208] [2025-03-08 11:01:57,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852548208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:57,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:57,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:01:57,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810128220] [2025-03-08 11:01:57,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:57,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:01:57,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:57,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:01:57,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:01:57,982 INFO L87 Difference]: Start difference. First operand 360 states and 589 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-08 11:01:58,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:58,121 INFO L93 Difference]: Finished difference Result 1074 states and 1761 transitions. [2025-03-08 11:01:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:01:58,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 446 [2025-03-08 11:01:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:58,131 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 11:01:58,132 INFO L226 Difference]: Without dead ends: 717 [2025-03-08 11:01:58,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:01:58,136 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 229 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:01:58,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 779 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:01:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-08 11:01:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2025-03-08 11:01:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 492 states have (on average 1.4898373983739837) internal successors, (733), 494 states have internal predecessors, (733), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-08 11:01:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1169 transitions. [2025-03-08 11:01:58,253 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1169 transitions. Word has length 446 [2025-03-08 11:01:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:58,257 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1169 transitions. [2025-03-08 11:01:58,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-08 11:01:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1169 transitions. [2025-03-08 11:01:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-08 11:01:58,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:58,263 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:58,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:01:58,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:58,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1409511210, now seen corresponding path program 1 times [2025-03-08 11:01:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811392295] [2025-03-08 11:01:58,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:58,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-08 11:01:58,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-08 11:01:58,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:58,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-08 11:01:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811392295] [2025-03-08 11:01:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811392295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:01:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615770855] [2025-03-08 11:01:58,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:01:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:58,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:01:58,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:01:58,606 INFO L87 Difference]: Start difference. First operand 715 states and 1169 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-08 11:01:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:01:58,702 INFO L93 Difference]: Finished difference Result 1425 states and 2331 transitions. [2025-03-08 11:01:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:01:58,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 447 [2025-03-08 11:01:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:01:58,711 INFO L225 Difference]: With dead ends: 1425 [2025-03-08 11:01:58,711 INFO L226 Difference]: Without dead ends: 713 [2025-03-08 11:01:58,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:01:58,715 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 344 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-08 11:01:58,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 344 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:01:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-08 11:01:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2025-03-08 11:01:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 490 states have (on average 1.4836734693877551) internal successors, (727), 492 states have internal predecessors, (727), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-08 11:01:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1163 transitions. [2025-03-08 11:01:58,779 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1163 transitions. Word has length 447 [2025-03-08 11:01:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:01:58,780 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1163 transitions. [2025-03-08 11:01:58,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-08 11:01:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1163 transitions. [2025-03-08 11:01:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 11:01:58,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:01:58,783 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:01:58,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:01:58,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:01:58,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:01:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash -114444247, now seen corresponding path program 1 times [2025-03-08 11:01:58,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:01:58,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952658778] [2025-03-08 11:01:58,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:01:58,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:01:58,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 11:01:58,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 11:01:58,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:01:58,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:01:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-08 11:01:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:01:59,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952658778] [2025-03-08 11:01:59,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952658778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:01:59,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:01:59,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:01:59,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027989520] [2025-03-08 11:01:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:01:59,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:01:59,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:01:59,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:01:59,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:01:59,720 INFO L87 Difference]: Start difference. First operand 713 states and 1163 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-08 11:02:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:01,204 INFO L93 Difference]: Finished difference Result 2163 states and 3500 transitions. [2025-03-08 11:02:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:02:01,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 448 [2025-03-08 11:02:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:01,217 INFO L225 Difference]: With dead ends: 2163 [2025-03-08 11:02:01,217 INFO L226 Difference]: Without dead ends: 1453 [2025-03-08 11:02:01,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:02:01,221 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 903 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:01,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1462 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:02:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-03-08 11:02:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1394. [2025-03-08 11:02:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 997 states have (on average 1.4914744232698094) internal successors, (1487), 1005 states have internal predecessors, (1487), 386 states have call successors, (386), 10 states have call predecessors, (386), 10 states have return successors, (386), 378 states have call predecessors, (386), 386 states have call successors, (386) [2025-03-08 11:02:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2259 transitions. [2025-03-08 11:02:01,373 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2259 transitions. Word has length 448 [2025-03-08 11:02:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:01,373 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2259 transitions. [2025-03-08 11:02:01,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-03-08 11:02:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2259 transitions. [2025-03-08 11:02:01,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 11:02:01,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:01,378 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:01,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:02:01,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:01,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1611036650, now seen corresponding path program 1 times [2025-03-08 11:02:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:01,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639390075] [2025-03-08 11:02:01,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:01,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 11:02:01,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 11:02:01,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:01,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-08 11:02:01,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639390075] [2025-03-08 11:02:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639390075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:01,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:01,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 11:02:01,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883829016] [2025-03-08 11:02:01,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:01,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 11:02:01,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:01,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 11:02:01,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:02:01,911 INFO L87 Difference]: Start difference. First operand 1394 states and 2259 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-03-08 11:02:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:02,915 INFO L93 Difference]: Finished difference Result 3988 states and 6405 transitions. [2025-03-08 11:02:02,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:02:02,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) Word has length 448 [2025-03-08 11:02:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:02,930 INFO L225 Difference]: With dead ends: 3988 [2025-03-08 11:02:02,930 INFO L226 Difference]: Without dead ends: 2597 [2025-03-08 11:02:02,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:02:02,936 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 1220 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:02,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 932 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:02:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2025-03-08 11:02:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2231. [2025-03-08 11:02:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 1638 states have (on average 1.4932844932844933) internal successors, (2446), 1652 states have internal predecessors, (2446), 566 states have call successors, (566), 26 states have call predecessors, (566), 26 states have return successors, (566), 552 states have call predecessors, (566), 566 states have call successors, (566) [2025-03-08 11:02:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 3578 transitions. [2025-03-08 11:02:03,186 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 3578 transitions. Word has length 448 [2025-03-08 11:02:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:03,188 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 3578 transitions. [2025-03-08 11:02:03,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-03-08 11:02:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 3578 transitions. [2025-03-08 11:02:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 11:02:03,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:03,194 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:03,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:02:03,195 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:03,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1696430935, now seen corresponding path program 1 times [2025-03-08 11:02:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720215964] [2025-03-08 11:02:03,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:03,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:03,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 11:02:03,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 11:02:03,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:03,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-08 11:02:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720215964] [2025-03-08 11:02:04,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720215964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:04,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:04,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:02:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790264571] [2025-03-08 11:02:04,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:04,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:02:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:04,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:02:04,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:02:04,462 INFO L87 Difference]: Start difference. First operand 2231 states and 3578 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-08 11:02:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:07,035 INFO L93 Difference]: Finished difference Result 5138 states and 8184 transitions. [2025-03-08 11:02:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:02:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 448 [2025-03-08 11:02:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:07,056 INFO L225 Difference]: With dead ends: 5138 [2025-03-08 11:02:07,056 INFO L226 Difference]: Without dead ends: 2910 [2025-03-08 11:02:07,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 11:02:07,064 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 1631 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:07,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 2453 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 11:02:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2025-03-08 11:02:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2379. [2025-03-08 11:02:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 1711 states have (on average 1.4716540035067212) internal successors, (2518), 1726 states have internal predecessors, (2518), 635 states have call successors, (635), 32 states have call predecessors, (635), 32 states have return successors, (635), 620 states have call predecessors, (635), 635 states have call successors, (635) [2025-03-08 11:02:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3788 transitions. [2025-03-08 11:02:07,336 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3788 transitions. Word has length 448 [2025-03-08 11:02:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:07,337 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3788 transitions. [2025-03-08 11:02:07,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-08 11:02:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3788 transitions. [2025-03-08 11:02:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 11:02:07,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:07,343 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:07,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:02:07,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:07,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:07,344 INFO L85 PathProgramCache]: Analyzing trace with hash 997128711, now seen corresponding path program 1 times [2025-03-08 11:02:07,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:07,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798795] [2025-03-08 11:02:07,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:07,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:07,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 11:02:07,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 11:02:07,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:07,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-08 11:02:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:08,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798795] [2025-03-08 11:02:08,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:08,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:08,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:02:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154732250] [2025-03-08 11:02:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:02:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:08,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:02:08,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:02:08,119 INFO L87 Difference]: Start difference. First operand 2379 states and 3788 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-03-08 11:02:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:09,727 INFO L93 Difference]: Finished difference Result 4935 states and 7832 transitions. [2025-03-08 11:02:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:02:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) Word has length 448 [2025-03-08 11:02:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:09,743 INFO L225 Difference]: With dead ends: 4935 [2025-03-08 11:02:09,743 INFO L226 Difference]: Without dead ends: 2693 [2025-03-08 11:02:09,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:02:09,751 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 1395 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:09,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 1868 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:02:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2025-03-08 11:02:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2140. [2025-03-08 11:02:09,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 1544 states have (on average 1.4779792746113989) internal successors, (2282), 1557 states have internal predecessors, (2282), 567 states have call successors, (567), 28 states have call predecessors, (567), 28 states have return successors, (567), 554 states have call predecessors, (567), 567 states have call successors, (567) [2025-03-08 11:02:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 3416 transitions. [2025-03-08 11:02:09,922 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 3416 transitions. Word has length 448 [2025-03-08 11:02:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:09,923 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 3416 transitions. [2025-03-08 11:02:09,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-03-08 11:02:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 3416 transitions. [2025-03-08 11:02:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 11:02:09,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:09,928 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:09,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:02:09,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:09,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1572357688, now seen corresponding path program 1 times [2025-03-08 11:02:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:09,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964540697] [2025-03-08 11:02:09,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:09,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 11:02:10,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 11:02:10,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:10,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 96 proven. 108 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-08 11:02:10,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964540697] [2025-03-08 11:02:10,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964540697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:02:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866674071] [2025-03-08 11:02:10,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:10,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:10,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:10,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:10,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:02:10,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 11:02:10,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 11:02:10,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:10,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:10,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:02:10,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4110 proven. 63 refuted. 0 times theorem prover too weak. 5211 trivial. 0 not checked. [2025-03-08 11:02:10,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:02:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 141 proven. 63 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-08 11:02:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866674071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:02:11,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:02:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-08 11:02:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086887021] [2025-03-08 11:02:11,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:02:11,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 11:02:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:11,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 11:02:11,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:02:11,350 INFO L87 Difference]: Start difference. First operand 2140 states and 3416 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) [2025-03-08 11:02:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:12,092 INFO L93 Difference]: Finished difference Result 3615 states and 5734 transitions. [2025-03-08 11:02:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 11:02:12,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) Word has length 448 [2025-03-08 11:02:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:12,105 INFO L225 Difference]: With dead ends: 3615 [2025-03-08 11:02:12,105 INFO L226 Difference]: Without dead ends: 1612 [2025-03-08 11:02:12,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 894 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:02:12,113 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 402 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:12,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 811 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 11:02:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-08 11:02:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1576. [2025-03-08 11:02:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1098 states have (on average 1.4316939890710383) internal successors, (1572), 1107 states have internal predecessors, (1572), 447 states have call successors, (447), 30 states have call predecessors, (447), 30 states have return successors, (447), 438 states have call predecessors, (447), 447 states have call successors, (447) [2025-03-08 11:02:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2466 transitions. [2025-03-08 11:02:12,291 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2466 transitions. Word has length 448 [2025-03-08 11:02:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:12,292 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2466 transitions. [2025-03-08 11:02:12,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 3 states have call successors, (126), 2 states have call predecessors, (126), 4 states have return successors, (128), 3 states have call predecessors, (128), 3 states have call successors, (128) [2025-03-08 11:02:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2466 transitions. [2025-03-08 11:02:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-08 11:02:12,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:12,297 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:12,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:02:12,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 11:02:12,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:12,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1752767269, now seen corresponding path program 1 times [2025-03-08 11:02:12,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:12,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271122333] [2025-03-08 11:02:12,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:12,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-08 11:02:12,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-08 11:02:12,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:12,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-03-08 11:02:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271122333] [2025-03-08 11:02:15,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271122333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:02:15,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:02:15,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:02:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183026337] [2025-03-08 11:02:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:02:15,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:02:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:15,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:02:15,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:02:15,240 INFO L87 Difference]: Start difference. First operand 1576 states and 2466 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-08 11:02:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:18,952 INFO L93 Difference]: Finished difference Result 5171 states and 8102 transitions. [2025-03-08 11:02:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:02:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 450 [2025-03-08 11:02:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:18,973 INFO L225 Difference]: With dead ends: 5171 [2025-03-08 11:02:18,974 INFO L226 Difference]: Without dead ends: 3740 [2025-03-08 11:02:18,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:02:18,980 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 2009 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:18,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2009 Valid, 1788 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 11:02:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2025-03-08 11:02:19,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 1383. [2025-03-08 11:02:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 981 states have (on average 1.438328236493374) internal successors, (1411), 986 states have internal predecessors, (1411), 359 states have call successors, (359), 42 states have call predecessors, (359), 42 states have return successors, (359), 354 states have call predecessors, (359), 359 states have call successors, (359) [2025-03-08 11:02:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2129 transitions. [2025-03-08 11:02:19,247 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2129 transitions. Word has length 450 [2025-03-08 11:02:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:19,247 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2129 transitions. [2025-03-08 11:02:19,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-03-08 11:02:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2129 transitions. [2025-03-08 11:02:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-08 11:02:19,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:19,250 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:19,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:02:19,251 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:19,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash -646229625, now seen corresponding path program 1 times [2025-03-08 11:02:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:19,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162320011] [2025-03-08 11:02:19,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:19,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:19,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-08 11:02:19,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-08 11:02:19,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:19,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:02:19,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423609833] [2025-03-08 11:02:19,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:19,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:19,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:19,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:19,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:02:19,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-08 11:02:19,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-08 11:02:19,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:19,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:19,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 11:02:19,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4740 proven. 108 refuted. 0 times theorem prover too weak. 4536 trivial. 0 not checked. [2025-03-08 11:02:20,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:02:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 96 proven. 108 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-08 11:02:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:21,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162320011] [2025-03-08 11:02:21,935 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:02:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423609833] [2025-03-08 11:02:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423609833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:02:21,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 11:02:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2025-03-08 11:02:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348919542] [2025-03-08 11:02:21,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 11:02:21,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:02:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:21,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:02:21,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:02:21,937 INFO L87 Difference]: Start difference. First operand 1383 states and 2129 transitions. Second operand has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 3 states have call successors, (138), 3 states have call predecessors, (138), 5 states have return successors, (138), 3 states have call predecessors, (138), 3 states have call successors, (138) [2025-03-08 11:02:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:02:26,625 INFO L93 Difference]: Finished difference Result 5564 states and 8630 transitions. [2025-03-08 11:02:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-08 11:02:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 3 states have call successors, (138), 3 states have call predecessors, (138), 5 states have return successors, (138), 3 states have call predecessors, (138), 3 states have call successors, (138) Word has length 450 [2025-03-08 11:02:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:02:26,647 INFO L225 Difference]: With dead ends: 5564 [2025-03-08 11:02:26,647 INFO L226 Difference]: Without dead ends: 4326 [2025-03-08 11:02:26,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 945 GetRequests, 892 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=767, Invalid=2095, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 11:02:26,653 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 4813 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 1031 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4978 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 4011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1031 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:02:26,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4978 Valid, 2600 Invalid, 4011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1031 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 11:02:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4326 states. [2025-03-08 11:02:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4326 to 2619. [2025-03-08 11:02:26,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2619 states, 1999 states have (on average 1.4947473736868435) internal successors, (2988), 2010 states have internal predecessors, (2988), 555 states have call successors, (555), 64 states have call predecessors, (555), 64 states have return successors, (555), 544 states have call predecessors, (555), 555 states have call successors, (555) [2025-03-08 11:02:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 4098 transitions. [2025-03-08 11:02:26,973 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 4098 transitions. Word has length 450 [2025-03-08 11:02:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:02:26,973 INFO L471 AbstractCegarLoop]: Abstraction has 2619 states and 4098 transitions. [2025-03-08 11:02:26,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 15 states have internal predecessors, (166), 3 states have call successors, (138), 3 states have call predecessors, (138), 5 states have return successors, (138), 3 states have call predecessors, (138), 3 states have call successors, (138) [2025-03-08 11:02:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 4098 transitions. [2025-03-08 11:02:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-08 11:02:26,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:02:26,978 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:02:26,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:02:27,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:27,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:02:27,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:02:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1304070630, now seen corresponding path program 1 times [2025-03-08 11:02:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:02:27,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373170216] [2025-03-08 11:02:27,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:02:27,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-08 11:02:27,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-08 11:02:27,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:27,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 96 proven. 108 refuted. 0 times theorem prover too weak. 9180 trivial. 0 not checked. [2025-03-08 11:02:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:02:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373170216] [2025-03-08 11:02:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373170216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:02:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637370102] [2025-03-08 11:02:28,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:02:28,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:02:28,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:02:28,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:02:28,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 11:02:29,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-08 11:02:29,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-08 11:02:29,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:02:29,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:02:29,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 11:02:29,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:02:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 4936 proven. 312 refuted. 0 times theorem prover too weak. 4136 trivial. 0 not checked. [2025-03-08 11:02:30,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:02:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 195 proven. 210 refuted. 0 times theorem prover too weak. 8979 trivial. 0 not checked. [2025-03-08 11:02:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637370102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:02:33,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:02:33,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 43 [2025-03-08 11:02:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431074940] [2025-03-08 11:02:33,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:02:33,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 11:02:33,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:02:33,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 11:02:33,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1513, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 11:02:33,186 INFO L87 Difference]: Start difference. First operand 2619 states and 4098 transitions. Second operand has 43 states, 42 states have (on average 6.380952380952381) internal successors, (268), 42 states have internal predecessors, (268), 11 states have call successors, (207), 5 states have call predecessors, (207), 10 states have return successors, (207), 10 states have call predecessors, (207), 11 states have call successors, (207) [2025-03-08 11:03:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:05,582 INFO L93 Difference]: Finished difference Result 17241 states and 26202 transitions. [2025-03-08 11:03:05,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 331 states. [2025-03-08 11:03:05,582 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 6.380952380952381) internal successors, (268), 42 states have internal predecessors, (268), 11 states have call successors, (207), 5 states have call predecessors, (207), 10 states have return successors, (207), 10 states have call predecessors, (207), 11 states have call successors, (207) Word has length 450 [2025-03-08 11:03:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:05,635 INFO L225 Difference]: With dead ends: 17241 [2025-03-08 11:03:05,636 INFO L226 Difference]: Without dead ends: 14767 [2025-03-08 11:03:05,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1309 GetRequests, 954 SyntacticMatches, 1 SemanticMatches, 354 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58076 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=20061, Invalid=106319, Unknown=0, NotChecked=0, Total=126380 [2025-03-08 11:03:05,658 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 18066 mSDsluCounter, 8741 mSDsCounter, 0 mSdLazyCounter, 12185 mSolverCounterSat, 8288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18196 SdHoareTripleChecker+Valid, 9572 SdHoareTripleChecker+Invalid, 20473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8288 IncrementalHoareTripleChecker+Valid, 12185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:05,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18196 Valid, 9572 Invalid, 20473 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8288 Valid, 12185 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2025-03-08 11:03:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14767 states. [2025-03-08 11:03:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14767 to 3563. [2025-03-08 11:03:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 2655 states have (on average 1.4677966101694915) internal successors, (3897), 2671 states have internal predecessors, (3897), 802 states have call successors, (802), 105 states have call predecessors, (802), 105 states have return successors, (802), 786 states have call predecessors, (802), 802 states have call successors, (802) [2025-03-08 11:03:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 5501 transitions. [2025-03-08 11:03:06,600 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 5501 transitions. Word has length 450 [2025-03-08 11:03:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:06,601 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 5501 transitions. [2025-03-08 11:03:06,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 6.380952380952381) internal successors, (268), 42 states have internal predecessors, (268), 11 states have call successors, (207), 5 states have call predecessors, (207), 10 states have return successors, (207), 10 states have call predecessors, (207), 11 states have call successors, (207) [2025-03-08 11:03:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 5501 transitions. [2025-03-08 11:03:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-08 11:03:06,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:06,606 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:03:06,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0