./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-47.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-47.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 cd3632043214757caefbf8e806ad884979d5d0588e1edb63db72323f63ea6c69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:59:01,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:59:01,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:59:01,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:59:01,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:59:01,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:59:01,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:59:01,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:59:01,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:59:01,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:59:01,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:59:01,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:59:01,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:59:01,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:59:01,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:59:01,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:59:01,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:59:01,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:59:01,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:59:01,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:59:01,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:59:01,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:59:01,149 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:59:01,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:59:01,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:59:01,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:59:01,150 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 -> cd3632043214757caefbf8e806ad884979d5d0588e1edb63db72323f63ea6c69 [2025-03-08 10:59:01,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:59:01,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:59:01,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:59:01,401 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:59:01,401 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:59:01,402 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-47.i [2025-03-08 10:59:02,559 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae9bb222/81ff89e84fe0498f91e84090f0c605c2/FLAGe2988f6e7 [2025-03-08 10:59:02,835 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:59:02,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-47.i [2025-03-08 10:59:02,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae9bb222/81ff89e84fe0498f91e84090f0c605c2/FLAGe2988f6e7 [2025-03-08 10:59:02,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae9bb222/81ff89e84fe0498f91e84090f0c605c2 [2025-03-08 10:59:02,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:59:02,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:59:02,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:59:02,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:59:02,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:59:02,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:02" (1/1) ... [2025-03-08 10:59:02,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1156cb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:02, skipping insertion in model container [2025-03-08 10:59:02,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:59:02" (1/1) ... [2025-03-08 10:59:02,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:59:03,004 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-47.i[916,929] [2025-03-08 10:59:03,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:59:03,134 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:59:03,144 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-47.i[916,929] [2025-03-08 10:59:03,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:59:03,221 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:59:03,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03 WrapperNode [2025-03-08 10:59:03,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:59:03,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:59:03,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:59:03,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:59:03,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,297 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 532 [2025-03-08 10:59:03,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:59:03,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:59:03,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:59:03,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:59:03,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,347 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:59:03,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:59:03,406 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:59:03,406 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:59:03,406 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:59:03,407 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (1/1) ... [2025-03-08 10:59:03,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:59:03,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:03,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:59:03,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:59:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:59:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:59:03,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:59:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:59:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:59:03,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:59:03,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:59:03,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:59:04,177 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc property_#t~bitwise48#1;havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short51#1; [2025-03-08 10:59:04,284 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 10:59:04,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:59:04,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:59:04,314 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:59:04,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:59:04 BoogieIcfgContainer [2025-03-08 10:59:04,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:59:04,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:59:04,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:59:04,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:59:04,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:59:02" (1/3) ... [2025-03-08 10:59:04,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af27ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:59:04, skipping insertion in model container [2025-03-08 10:59:04,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:59:03" (2/3) ... [2025-03-08 10:59:04,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af27ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:59:04, skipping insertion in model container [2025-03-08 10:59:04,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:59:04" (3/3) ... [2025-03-08 10:59:04,323 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-47.i [2025-03-08 10:59:04,334 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:59:04,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-47.i that has 2 procedures, 226 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:59:04,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:59:04,401 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;@129d09c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:59:04,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:59:04,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 226 states, 157 states have (on average 1.5477707006369428) internal successors, (243), 158 states have internal predecessors, (243), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:59:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 10:59:04,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:04,426 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:04,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 18321291, now seen corresponding path program 1 times [2025-03-08 10:59:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:04,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366109115] [2025-03-08 10:59:04,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:04,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 10:59:04,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 10:59:04,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:04,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-08 10:59:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366109115] [2025-03-08 10:59:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366109115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:59:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194502695] [2025-03-08 10:59:04,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:04,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:59:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:04,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:59:04,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:59:05,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 10:59:05,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 10:59:05,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:05,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:05,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:59:05,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:59:05,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2025-03-08 10:59:05,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:59:05,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194502695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:05,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:59:05,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:59:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193125620] [2025-03-08 10:59:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:05,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:59:05,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:05,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:59:05,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:59:05,238 INFO L87 Difference]: Start difference. First operand has 226 states, 157 states have (on average 1.5477707006369428) internal successors, (243), 158 states have internal predecessors, (243), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 10:59:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:05,288 INFO L93 Difference]: Finished difference Result 446 states and 811 transitions. [2025-03-08 10:59:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:59:05,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 428 [2025-03-08 10:59:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:05,296 INFO L225 Difference]: With dead ends: 446 [2025-03-08 10:59:05,296 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 10:59:05,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:59:05,301 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:05,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 10:59:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-08 10:59:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 155 states have (on average 1.5096774193548388) internal successors, (234), 155 states have internal predecessors, (234), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:59:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 366 transitions. [2025-03-08 10:59:05,343 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 366 transitions. Word has length 428 [2025-03-08 10:59:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:05,343 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 366 transitions. [2025-03-08 10:59:05,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.5) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2025-03-08 10:59:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 366 transitions. [2025-03-08 10:59:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 10:59:05,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:05,353 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:05,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:59:05,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:59:05,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:05,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash 368396336, now seen corresponding path program 1 times [2025-03-08 10:59:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:05,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826602875] [2025-03-08 10:59:05,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:05,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 10:59:05,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 10:59:05,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:05,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826602875] [2025-03-08 10:59:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826602875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:05,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:05,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:05,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999679377] [2025-03-08 10:59:05,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:05,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:05,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:05,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:05,919 INFO L87 Difference]: Start difference. First operand 223 states and 366 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:06,021 INFO L93 Difference]: Finished difference Result 596 states and 979 transitions. [2025-03-08 10:59:06,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:06,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 429 [2025-03-08 10:59:06,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:06,026 INFO L225 Difference]: With dead ends: 596 [2025-03-08 10:59:06,029 INFO L226 Difference]: Without dead ends: 376 [2025-03-08 10:59:06,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:06,032 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 239 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:06,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 888 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:59:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-08 10:59:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2025-03-08 10:59:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 277 states have (on average 1.523465703971119) internal successors, (422), 278 states have internal predecessors, (422), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 10:59:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 608 transitions. [2025-03-08 10:59:06,081 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 608 transitions. Word has length 429 [2025-03-08 10:59:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:06,083 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 608 transitions. [2025-03-08 10:59:06,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 608 transitions. [2025-03-08 10:59:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-08 10:59:06,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:06,089 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:06,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:59:06,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:06,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:06,090 INFO L85 PathProgramCache]: Analyzing trace with hash 720551303, now seen corresponding path program 1 times [2025-03-08 10:59:06,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:06,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716571533] [2025-03-08 10:59:06,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:06,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:06,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-08 10:59:06,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-08 10:59:06,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:06,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:06,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:06,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716571533] [2025-03-08 10:59:06,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716571533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:06,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:06,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:06,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688311094] [2025-03-08 10:59:06,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:06,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:06,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:06,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:06,622 INFO L87 Difference]: Start difference. First operand 373 states and 608 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:06,717 INFO L93 Difference]: Finished difference Result 1113 states and 1818 transitions. [2025-03-08 10:59:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 430 [2025-03-08 10:59:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:06,726 INFO L225 Difference]: With dead ends: 1113 [2025-03-08 10:59:06,728 INFO L226 Difference]: Without dead ends: 743 [2025-03-08 10:59:06,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:06,730 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 230 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:06,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 792 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-08 10:59:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2025-03-08 10:59:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 550 states have (on average 1.5236363636363637) internal successors, (838), 552 states have internal predecessors, (838), 186 states have call successors, (186), 4 states have call predecessors, (186), 4 states have return successors, (186), 184 states have call predecessors, (186), 186 states have call successors, (186) [2025-03-08 10:59:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1210 transitions. [2025-03-08 10:59:06,847 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1210 transitions. Word has length 430 [2025-03-08 10:59:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:06,851 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1210 transitions. [2025-03-08 10:59:06,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1210 transitions. [2025-03-08 10:59:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-08 10:59:06,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:06,857 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:59:06,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:06,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1334459472, now seen corresponding path program 1 times [2025-03-08 10:59:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:06,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792085525] [2025-03-08 10:59:06,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:06,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-08 10:59:06,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-08 10:59:06,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:06,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:07,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792085525] [2025-03-08 10:59:07,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792085525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:07,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:07,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:59:07,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099113180] [2025-03-08 10:59:07,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:07,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:59:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:07,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:59:07,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:59:07,661 INFO L87 Difference]: Start difference. First operand 741 states and 1210 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:08,393 INFO L93 Difference]: Finished difference Result 2776 states and 4511 transitions. [2025-03-08 10:59:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:59:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 431 [2025-03-08 10:59:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:08,403 INFO L225 Difference]: With dead ends: 2776 [2025-03-08 10:59:08,403 INFO L226 Difference]: Without dead ends: 2038 [2025-03-08 10:59:08,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:08,406 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 918 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:08,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1340 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:59:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2025-03-08 10:59:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1525. [2025-03-08 10:59:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1144 states have (on average 1.513986013986014) internal successors, (1732), 1148 states have internal predecessors, (1732), 372 states have call successors, (372), 8 states have call predecessors, (372), 8 states have return successors, (372), 368 states have call predecessors, (372), 372 states have call successors, (372) [2025-03-08 10:59:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2476 transitions. [2025-03-08 10:59:08,555 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2476 transitions. Word has length 431 [2025-03-08 10:59:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:08,556 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2476 transitions. [2025-03-08 10:59:08,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2476 transitions. [2025-03-08 10:59:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-08 10:59:08,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:08,563 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:08,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:59:08,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:08,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2116035953, now seen corresponding path program 1 times [2025-03-08 10:59:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:08,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141543149] [2025-03-08 10:59:08,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:08,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:08,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-08 10:59:08,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-08 10:59:08,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:08,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:09,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:09,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141543149] [2025-03-08 10:59:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141543149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:09,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:09,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298056398] [2025-03-08 10:59:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:09,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:09,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:09,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:09,304 INFO L87 Difference]: Start difference. First operand 1525 states and 2476 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:09,733 INFO L93 Difference]: Finished difference Result 2663 states and 4323 transitions. [2025-03-08 10:59:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:59:09,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 431 [2025-03-08 10:59:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:09,744 INFO L225 Difference]: With dead ends: 2663 [2025-03-08 10:59:09,744 INFO L226 Difference]: Without dead ends: 1141 [2025-03-08 10:59:09,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:59:09,750 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 321 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:09,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1038 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:59:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-08 10:59:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1052. [2025-03-08 10:59:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 794 states have (on average 1.5314861460957179) internal successors, (1216), 796 states have internal predecessors, (1216), 252 states have call successors, (252), 5 states have call predecessors, (252), 5 states have return successors, (252), 250 states have call predecessors, (252), 252 states have call successors, (252) [2025-03-08 10:59:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1720 transitions. [2025-03-08 10:59:09,844 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1720 transitions. Word has length 431 [2025-03-08 10:59:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:09,844 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1720 transitions. [2025-03-08 10:59:09,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1720 transitions. [2025-03-08 10:59:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-08 10:59:09,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:09,852 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:09,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:59:09,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:09,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash 202179791, now seen corresponding path program 1 times [2025-03-08 10:59:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:09,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508158181] [2025-03-08 10:59:09,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:09,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 10:59:09,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 10:59:09,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:09,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508158181] [2025-03-08 10:59:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508158181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:59:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141743003] [2025-03-08 10:59:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:10,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:59:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:10,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:59:10,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:10,657 INFO L87 Difference]: Start difference. First operand 1052 states and 1720 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:11,439 INFO L93 Difference]: Finished difference Result 3457 states and 5618 transitions. [2025-03-08 10:59:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:59:11,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 433 [2025-03-08 10:59:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:11,452 INFO L225 Difference]: With dead ends: 3457 [2025-03-08 10:59:11,453 INFO L226 Difference]: Without dead ends: 2659 [2025-03-08 10:59:11,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:59:11,456 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 790 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:11,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 2130 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:59:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2025-03-08 10:59:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2651. [2025-03-08 10:59:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 2057 states have (on average 1.53475935828877) internal successors, (3157), 2065 states have internal predecessors, (3157), 580 states have call successors, (580), 13 states have call predecessors, (580), 13 states have return successors, (580), 572 states have call predecessors, (580), 580 states have call successors, (580) [2025-03-08 10:59:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 4317 transitions. [2025-03-08 10:59:11,635 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 4317 transitions. Word has length 433 [2025-03-08 10:59:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:11,636 INFO L471 AbstractCegarLoop]: Abstraction has 2651 states and 4317 transitions. [2025-03-08 10:59:11,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 4317 transitions. [2025-03-08 10:59:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:59:11,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:11,639 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:11,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:59:11,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:11,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:11,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2037701558, now seen corresponding path program 1 times [2025-03-08 10:59:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357753779] [2025-03-08 10:59:11,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:11,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:11,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:59:11,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:59:11,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:11,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357753779] [2025-03-08 10:59:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357753779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:13,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:13,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:59:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272133446] [2025-03-08 10:59:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:13,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:59:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:13,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:59:13,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:13,674 INFO L87 Difference]: Start difference. First operand 2651 states and 4317 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:16,346 INFO L93 Difference]: Finished difference Result 5379 states and 8661 transitions. [2025-03-08 10:59:16,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 10:59:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 434 [2025-03-08 10:59:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:16,370 INFO L225 Difference]: With dead ends: 5379 [2025-03-08 10:59:16,370 INFO L226 Difference]: Without dead ends: 4257 [2025-03-08 10:59:16,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 10:59:16,377 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 1326 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:16,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 3105 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 10:59:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2025-03-08 10:59:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3647. [2025-03-08 10:59:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3647 states, 2754 states have (on average 1.508714596949891) internal successors, (4155), 2768 states have internal predecessors, (4155), 860 states have call successors, (860), 32 states have call predecessors, (860), 32 states have return successors, (860), 846 states have call predecessors, (860), 860 states have call successors, (860) [2025-03-08 10:59:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 5875 transitions. [2025-03-08 10:59:16,659 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 5875 transitions. Word has length 434 [2025-03-08 10:59:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:16,661 INFO L471 AbstractCegarLoop]: Abstraction has 3647 states and 5875 transitions. [2025-03-08 10:59:16,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 5875 transitions. [2025-03-08 10:59:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-08 10:59:16,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:16,664 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:16,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:59:16,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:16,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:16,665 INFO L85 PathProgramCache]: Analyzing trace with hash 18797713, now seen corresponding path program 1 times [2025-03-08 10:59:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:16,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294335681] [2025-03-08 10:59:16,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:16,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-08 10:59:16,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-08 10:59:16,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:16,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:16,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294335681] [2025-03-08 10:59:16,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294335681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:16,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:16,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:59:16,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159531778] [2025-03-08 10:59:16,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:16,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:59:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:16,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:59:16,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:16,873 INFO L87 Difference]: Start difference. First operand 3647 states and 5875 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:17,223 INFO L93 Difference]: Finished difference Result 10291 states and 16549 transitions. [2025-03-08 10:59:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:59:17,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 434 [2025-03-08 10:59:17,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:17,260 INFO L225 Difference]: With dead ends: 10291 [2025-03-08 10:59:17,260 INFO L226 Difference]: Without dead ends: 6997 [2025-03-08 10:59:17,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:59:17,273 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 228 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:17,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 814 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:59:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6997 states. [2025-03-08 10:59:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6997 to 6943. [2025-03-08 10:59:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6943 states, 5226 states have (on average 1.4998086490623803) internal successors, (7838), 5254 states have internal predecessors, (7838), 1654 states have call successors, (1654), 62 states have call predecessors, (1654), 62 states have return successors, (1654), 1626 states have call predecessors, (1654), 1654 states have call successors, (1654) [2025-03-08 10:59:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 11146 transitions. [2025-03-08 10:59:17,767 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 11146 transitions. Word has length 434 [2025-03-08 10:59:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:17,768 INFO L471 AbstractCegarLoop]: Abstraction has 6943 states and 11146 transitions. [2025-03-08 10:59:17,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 11146 transitions. [2025-03-08 10:59:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 10:59:17,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:17,773 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:17,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:59:17,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:17,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash -470971789, now seen corresponding path program 1 times [2025-03-08 10:59:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976388071] [2025-03-08 10:59:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:17,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 10:59:17,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 10:59:17,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976388071] [2025-03-08 10:59:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976388071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:18,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:18,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:59:18,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590834294] [2025-03-08 10:59:18,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:18,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:59:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:18,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:59:18,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:18,365 INFO L87 Difference]: Start difference. First operand 6943 states and 11146 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:20,910 INFO L93 Difference]: Finished difference Result 24573 states and 39366 transitions. [2025-03-08 10:59:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:59:20,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 435 [2025-03-08 10:59:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:21,005 INFO L225 Difference]: With dead ends: 24573 [2025-03-08 10:59:21,006 INFO L226 Difference]: Without dead ends: 21429 [2025-03-08 10:59:21,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:59:21,025 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 1587 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:21,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 2704 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 10:59:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2025-03-08 10:59:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 12492. [2025-03-08 10:59:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12492 states, 9910 states have (on average 1.5230070635721493) internal successors, (15093), 9974 states have internal predecessors, (15093), 2482 states have call successors, (2482), 99 states have call predecessors, (2482), 99 states have return successors, (2482), 2418 states have call predecessors, (2482), 2482 states have call successors, (2482) [2025-03-08 10:59:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12492 states to 12492 states and 20057 transitions. [2025-03-08 10:59:21,864 INFO L78 Accepts]: Start accepts. Automaton has 12492 states and 20057 transitions. Word has length 435 [2025-03-08 10:59:21,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:21,866 INFO L471 AbstractCegarLoop]: Abstraction has 12492 states and 20057 transitions. [2025-03-08 10:59:21,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 12492 states and 20057 transitions. [2025-03-08 10:59:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 10:59:21,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:21,872 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:21,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:59:21,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:21,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash 553722132, now seen corresponding path program 1 times [2025-03-08 10:59:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168759834] [2025-03-08 10:59:21,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:21,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 10:59:21,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 10:59:21,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:21,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:24,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168759834] [2025-03-08 10:59:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168759834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:24,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:24,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 10:59:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986956554] [2025-03-08 10:59:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:24,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:59:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:24,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:59:24,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:59:24,624 INFO L87 Difference]: Start difference. First operand 12492 states and 20057 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:26,563 INFO L93 Difference]: Finished difference Result 17748 states and 28434 transitions. [2025-03-08 10:59:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:59:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 435 [2025-03-08 10:59:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:26,611 INFO L225 Difference]: With dead ends: 17748 [2025-03-08 10:59:26,612 INFO L226 Difference]: Without dead ends: 14679 [2025-03-08 10:59:26,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:59:26,622 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 1384 mSDsluCounter, 2099 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 2675 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:26,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 2675 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 10:59:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14679 states. [2025-03-08 10:59:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14679 to 13444. [2025-03-08 10:59:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13444 states, 10708 states have (on average 1.5234404183787822) internal successors, (16313), 10776 states have internal predecessors, (16313), 2628 states have call successors, (2628), 107 states have call predecessors, (2628), 107 states have return successors, (2628), 2560 states have call predecessors, (2628), 2628 states have call successors, (2628) [2025-03-08 10:59:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13444 states to 13444 states and 21569 transitions. [2025-03-08 10:59:27,507 INFO L78 Accepts]: Start accepts. Automaton has 13444 states and 21569 transitions. Word has length 435 [2025-03-08 10:59:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:27,508 INFO L471 AbstractCegarLoop]: Abstraction has 13444 states and 21569 transitions. [2025-03-08 10:59:27,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 13444 states and 21569 transitions. [2025-03-08 10:59:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 10:59:27,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:27,516 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:27,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:59:27,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:27,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1629954795, now seen corresponding path program 1 times [2025-03-08 10:59:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820963664] [2025-03-08 10:59:27,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:27,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 10:59:27,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 10:59:27,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:27,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820963664] [2025-03-08 10:59:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820963664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:28,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:59:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520667885] [2025-03-08 10:59:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:28,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:59:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:28,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:59:28,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:59:28,057 INFO L87 Difference]: Start difference. First operand 13444 states and 21569 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:30,367 INFO L93 Difference]: Finished difference Result 48469 states and 77674 transitions. [2025-03-08 10:59:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:59:30,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 435 [2025-03-08 10:59:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:30,497 INFO L225 Difference]: With dead ends: 48469 [2025-03-08 10:59:30,497 INFO L226 Difference]: Without dead ends: 36949 [2025-03-08 10:59:30,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:30,532 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 438 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:30,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1690 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:59:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36949 states. [2025-03-08 10:59:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36949 to 27479. [2025-03-08 10:59:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27479 states, 22077 states have (on average 1.49653485527925) internal successors, (33039), 22213 states have internal predecessors, (33039), 5190 states have call successors, (5190), 211 states have call predecessors, (5190), 211 states have return successors, (5190), 5054 states have call predecessors, (5190), 5190 states have call successors, (5190) [2025-03-08 10:59:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27479 states to 27479 states and 43419 transitions. [2025-03-08 10:59:32,567 INFO L78 Accepts]: Start accepts. Automaton has 27479 states and 43419 transitions. Word has length 435 [2025-03-08 10:59:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:32,568 INFO L471 AbstractCegarLoop]: Abstraction has 27479 states and 43419 transitions. [2025-03-08 10:59:32,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 27479 states and 43419 transitions. [2025-03-08 10:59:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 10:59:32,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:32,579 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:32,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:59:32,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:32,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 226993067, now seen corresponding path program 1 times [2025-03-08 10:59:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:32,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519413410] [2025-03-08 10:59:32,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:32,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:32,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:59:32,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:59:32,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:32,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:33,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519413410] [2025-03-08 10:59:33,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519413410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:33,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:33,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:59:33,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644751298] [2025-03-08 10:59:33,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:33,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:59:33,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:33,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:59:33,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:59:33,125 INFO L87 Difference]: Start difference. First operand 27479 states and 43419 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:35,730 INFO L93 Difference]: Finished difference Result 60171 states and 95807 transitions. [2025-03-08 10:59:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:59:35,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 436 [2025-03-08 10:59:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:35,868 INFO L225 Difference]: With dead ends: 60171 [2025-03-08 10:59:35,868 INFO L226 Difference]: Without dead ends: 48651 [2025-03-08 10:59:35,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:59:35,902 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 345 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:35,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1665 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:59:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48651 states. [2025-03-08 10:59:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48651 to 15682. [2025-03-08 10:59:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15682 states, 12946 states have (on average 1.4905762397651785) internal successors, (19297), 13014 states have internal predecessors, (19297), 2628 states have call successors, (2628), 107 states have call predecessors, (2628), 107 states have return successors, (2628), 2560 states have call predecessors, (2628), 2628 states have call successors, (2628) [2025-03-08 10:59:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15682 states to 15682 states and 24553 transitions. [2025-03-08 10:59:37,534 INFO L78 Accepts]: Start accepts. Automaton has 15682 states and 24553 transitions. Word has length 436 [2025-03-08 10:59:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:37,535 INFO L471 AbstractCegarLoop]: Abstraction has 15682 states and 24553 transitions. [2025-03-08 10:59:37,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 15682 states and 24553 transitions. [2025-03-08 10:59:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 10:59:37,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:37,543 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:37,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:59:37,543 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:37,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1046906328, now seen corresponding path program 1 times [2025-03-08 10:59:37,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:37,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603369413] [2025-03-08 10:59:37,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:37,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:37,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:59:37,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:59:37,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:37,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 108 proven. 87 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-08 10:59:37,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603369413] [2025-03-08 10:59:37,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603369413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:59:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559319431] [2025-03-08 10:59:37,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:37,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:59:37,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:37,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:59:37,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:59:37,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:59:38,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:59:38,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:38,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:38,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:59:38,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:59:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4313 proven. 87 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2025-03-08 10:59:38,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:59:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 108 proven. 87 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-08 10:59:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559319431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:59:38,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:59:38,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 10:59:38,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6956282] [2025-03-08 10:59:38,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:59:38,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:59:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:38,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:59:38,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:38,578 INFO L87 Difference]: Start difference. First operand 15682 states and 24553 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-08 10:59:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:39,343 INFO L93 Difference]: Finished difference Result 23544 states and 36749 transitions. [2025-03-08 10:59:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:59:39,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 436 [2025-03-08 10:59:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:39,377 INFO L225 Difference]: With dead ends: 23544 [2025-03-08 10:59:39,377 INFO L226 Difference]: Without dead ends: 8535 [2025-03-08 10:59:39,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 870 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:59:39,397 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 443 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:39,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 684 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:59:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8535 states. [2025-03-08 10:59:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8535 to 8429. [2025-03-08 10:59:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8429 states, 6988 states have (on average 1.4869776760160274) internal successors, (10391), 7024 states have internal predecessors, (10391), 1374 states have call successors, (1374), 66 states have call predecessors, (1374), 66 states have return successors, (1374), 1338 states have call predecessors, (1374), 1374 states have call successors, (1374) [2025-03-08 10:59:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8429 states to 8429 states and 13139 transitions. [2025-03-08 10:59:39,950 INFO L78 Accepts]: Start accepts. Automaton has 8429 states and 13139 transitions. Word has length 436 [2025-03-08 10:59:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:39,951 INFO L471 AbstractCegarLoop]: Abstraction has 8429 states and 13139 transitions. [2025-03-08 10:59:39,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-03-08 10:59:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 8429 states and 13139 transitions. [2025-03-08 10:59:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 10:59:39,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:39,956 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:39,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:59:40,157 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,SelfDestructingSolverStorable12 [2025-03-08 10:59:40,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:40,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash 732174729, now seen corresponding path program 1 times [2025-03-08 10:59:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:40,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141153459] [2025-03-08 10:59:40,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:40,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:59:40,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:59:40,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:40,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 10:59:43,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:43,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141153459] [2025-03-08 10:59:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141153459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:59:43,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:59:43,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:59:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868190336] [2025-03-08 10:59:43,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:59:43,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:59:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:43,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:59:43,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:59:43,336 INFO L87 Difference]: Start difference. First operand 8429 states and 13139 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:59:44,518 INFO L93 Difference]: Finished difference Result 12762 states and 19860 transitions. [2025-03-08 10:59:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:59:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 436 [2025-03-08 10:59:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:59:44,545 INFO L225 Difference]: With dead ends: 12762 [2025-03-08 10:59:44,545 INFO L226 Difference]: Without dead ends: 8439 [2025-03-08 10:59:44,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:59:44,555 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 525 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:59:44,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1478 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:59:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8439 states. [2025-03-08 10:59:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8439 to 8437. [2025-03-08 10:59:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8437 states, 6996 states have (on average 1.48642081189251) internal successors, (10399), 7032 states have internal predecessors, (10399), 1374 states have call successors, (1374), 66 states have call predecessors, (1374), 66 states have return successors, (1374), 1338 states have call predecessors, (1374), 1374 states have call successors, (1374) [2025-03-08 10:59:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 13147 transitions. [2025-03-08 10:59:45,380 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 13147 transitions. Word has length 436 [2025-03-08 10:59:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:59:45,380 INFO L471 AbstractCegarLoop]: Abstraction has 8437 states and 13147 transitions. [2025-03-08 10:59:45,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 10:59:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 13147 transitions. [2025-03-08 10:59:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 10:59:45,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:59:45,386 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:59:45,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:59:45,386 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:59:45,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:59:45,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1757666728, now seen corresponding path program 1 times [2025-03-08 10:59:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:59:45,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282826983] [2025-03-08 10:59:45,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:45,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:59:45,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:59:45,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:59:45,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:45,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 285 proven. 99 refuted. 0 times theorem prover too weak. 8196 trivial. 0 not checked. [2025-03-08 10:59:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:59:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282826983] [2025-03-08 10:59:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282826983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:59:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886712076] [2025-03-08 10:59:45,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:59:45,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:59:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:59:45,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:59:45,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:59:46,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 10:59:46,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 10:59:46,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:59:46,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:59:46,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 10:59:46,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:59:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4145 proven. 75 refuted. 0 times theorem prover too weak. 4360 trivial. 0 not checked. [2025-03-08 10:59:46,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:59:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 120 proven. 75 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-08 10:59:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886712076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:59:47,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:59:47,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-03-08 10:59:47,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117957579] [2025-03-08 10:59:47,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:59:47,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 10:59:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:59:47,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 10:59:47,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-03-08 10:59:47,452 INFO L87 Difference]: Start difference. First operand 8437 states and 13147 transitions. Second operand has 20 states, 20 states have (on average 12.3) internal successors, (246), 20 states have internal predecessors, (246), 6 states have call successors, (157), 3 states have call predecessors, (157), 6 states have return successors, (158), 6 states have call predecessors, (158), 6 states have call successors, (158) [2025-03-08 11:00:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:03,172 INFO L93 Difference]: Finished difference Result 70157 states and 106984 transitions. [2025-03-08 11:00:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 275 states. [2025-03-08 11:00:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.3) internal successors, (246), 20 states have internal predecessors, (246), 6 states have call successors, (157), 3 states have call predecessors, (157), 6 states have return successors, (158), 6 states have call predecessors, (158), 6 states have call successors, (158) Word has length 436 [2025-03-08 11:00:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:03,311 INFO L225 Difference]: With dead ends: 70157 [2025-03-08 11:00:03,312 INFO L226 Difference]: Without dead ends: 62685 [2025-03-08 11:00:03,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 899 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40571 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=12478, Invalid=71912, Unknown=0, NotChecked=0, Total=84390 [2025-03-08 11:00:03,352 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 9888 mSDsluCounter, 3593 mSDsCounter, 0 mSdLazyCounter, 4949 mSolverCounterSat, 4263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9888 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 9212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4263 IncrementalHoareTripleChecker+Valid, 4949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:03,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9888 Valid, 3990 Invalid, 9212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4263 Valid, 4949 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-08 11:00:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62685 states. [2025-03-08 11:00:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62685 to 12755. [2025-03-08 11:00:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12755 states, 10237 states have (on average 1.455211487740549) internal successors, (14897), 10289 states have internal predecessors, (14897), 2319 states have call successors, (2319), 198 states have call predecessors, (2319), 198 states have return successors, (2319), 2267 states have call predecessors, (2319), 2319 states have call successors, (2319) [2025-03-08 11:00:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12755 states to 12755 states and 19535 transitions. [2025-03-08 11:00:05,609 INFO L78 Accepts]: Start accepts. Automaton has 12755 states and 19535 transitions. Word has length 436 [2025-03-08 11:00:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:05,610 INFO L471 AbstractCegarLoop]: Abstraction has 12755 states and 19535 transitions. [2025-03-08 11:00:05,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.3) internal successors, (246), 20 states have internal predecessors, (246), 6 states have call successors, (157), 3 states have call predecessors, (157), 6 states have return successors, (158), 6 states have call predecessors, (158), 6 states have call successors, (158) [2025-03-08 11:00:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 12755 states and 19535 transitions. [2025-03-08 11:00:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 11:00:05,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:05,614 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:05,625 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:00:05,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:00:05,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:05,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1382060543, now seen corresponding path program 1 times [2025-03-08 11:00:05,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:05,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743391041] [2025-03-08 11:00:05,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:05,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 11:00:05,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 11:00:05,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:05,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2025-03-08 11:00:06,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:06,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743391041] [2025-03-08 11:00:06,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743391041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:00:06,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:00:06,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:00:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154784335] [2025-03-08 11:00:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:00:06,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:00:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:06,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:00:06,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:00:06,055 INFO L87 Difference]: Start difference. First operand 12755 states and 19535 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 11:00:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:00:07,556 INFO L93 Difference]: Finished difference Result 26390 states and 40403 transitions. [2025-03-08 11:00:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:00:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 436 [2025-03-08 11:00:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:00:07,599 INFO L225 Difference]: With dead ends: 26390 [2025-03-08 11:00:07,599 INFO L226 Difference]: Without dead ends: 14565 [2025-03-08 11:00:07,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:00:07,623 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 236 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:00:07,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1138 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:00:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14565 states. [2025-03-08 11:00:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14565 to 14525. [2025-03-08 11:00:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14525 states, 11666 states have (on average 1.4537973598491343) internal successors, (16960), 11725 states have internal predecessors, (16960), 2637 states have call successors, (2637), 221 states have call predecessors, (2637), 221 states have return successors, (2637), 2578 states have call predecessors, (2637), 2637 states have call successors, (2637) [2025-03-08 11:00:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14525 states to 14525 states and 22234 transitions. [2025-03-08 11:00:09,199 INFO L78 Accepts]: Start accepts. Automaton has 14525 states and 22234 transitions. Word has length 436 [2025-03-08 11:00:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:00:09,199 INFO L471 AbstractCegarLoop]: Abstraction has 14525 states and 22234 transitions. [2025-03-08 11:00:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2025-03-08 11:00:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 14525 states and 22234 transitions. [2025-03-08 11:00:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-08 11:00:09,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:00:09,203 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:09,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 11:00:09,203 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:00:09,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:00:09,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2036818283, now seen corresponding path program 1 times [2025-03-08 11:00:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:00:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361885921] [2025-03-08 11:00:09,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:00:09,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 11:00:09,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 11:00:09,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:09,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-08 11:00:09,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:00:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361885921] [2025-03-08 11:00:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361885921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:00:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265416108] [2025-03-08 11:00:09,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:00:09,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:00:09,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:00:09,539 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:00:09,542 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:00:09,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-08 11:00:09,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-08 11:00:09,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:00:09,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:00:09,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 11:00:09,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:00:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 3549 proven. 630 refuted. 0 times theorem prover too weak. 4401 trivial. 0 not checked. [2025-03-08 11:00:12,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:00:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 114 proven. 462 refuted. 0 times theorem prover too weak. 8004 trivial. 0 not checked. [2025-03-08 11:00:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265416108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:00:14,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:00:14,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 12] total 30 [2025-03-08 11:00:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372462309] [2025-03-08 11:00:14,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:00:14,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 11:00:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:00:14,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 11:00:14,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2025-03-08 11:00:14,299 INFO L87 Difference]: Start difference. First operand 14525 states and 22234 transitions. Second operand has 30 states, 29 states have (on average 11.655172413793103) internal successors, (338), 27 states have internal predecessors, (338), 11 states have call successors, (198), 6 states have call predecessors, (198), 12 states have return successors, (198), 11 states have call predecessors, (198), 11 states have call successors, (198)