./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c41233577d4f3add43688eebc1dd327b554f3a213d6a52593493024e00cc2d82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:52:57,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:52:57,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:52:57,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:52:57,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:52:57,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:52:57,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:52:57,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:52:57,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:52:57,166 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:52:57,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:52:57,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:52:57,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:52:57,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:52:57,167 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:52:57,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:52:57,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:52:57,168 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:52:57,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:52:57,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:52:57,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:52:57,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:52:57,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:52:57,169 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:52:57,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:52:57,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:52:57,170 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:52:57,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:52:57,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:52:57,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:52:57,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:52:57,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:52:57,170 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c41233577d4f3add43688eebc1dd327b554f3a213d6a52593493024e00cc2d82 [2025-02-05 21:52:57,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:52:57,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:52:57,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:52:57,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:52:57,408 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:52:57,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i [2025-02-05 21:52:58,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa79b761/21d4206f671b46a29f8bbc3402e267dd/FLAGd82f014b5 [2025-02-05 21:52:58,932 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:52:58,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i [2025-02-05 21:52:58,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa79b761/21d4206f671b46a29f8bbc3402e267dd/FLAGd82f014b5 [2025-02-05 21:52:59,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6fa79b761/21d4206f671b46a29f8bbc3402e267dd [2025-02-05 21:52:59,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:52:59,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:52:59,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:52:59,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:52:59,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:52:59,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59, skipping insertion in model container [2025-02-05 21:52:59,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:52:59,340 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i[915,928] [2025-02-05 21:52:59,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:52:59,408 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:52:59,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-86.i[915,928] [2025-02-05 21:52:59,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:52:59,481 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:52:59,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59 WrapperNode [2025-02-05 21:52:59,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:52:59,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:52:59,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:52:59,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:52:59,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,539 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2025-02-05 21:52:59,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:52:59,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:52:59,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:52:59,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:52:59,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,590 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:52:59,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:52:59,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:52:59,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:52:59,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:52:59,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (1/1) ... [2025-02-05 21:52:59,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:52:59,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:52:59,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:52:59,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:52:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:52:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:52:59,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:52:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:52:59,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:52:59,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:52:59,712 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:52:59,714 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:53:00,023 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-05 21:53:00,024 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:53:00,039 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:53:00,039 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:53:00,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:53:00 BoogieIcfgContainer [2025-02-05 21:53:00,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:53:00,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:53:00,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:53:00,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:53:00,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:52:59" (1/3) ... [2025-02-05 21:53:00,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d6a25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:53:00, skipping insertion in model container [2025-02-05 21:53:00,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:52:59" (2/3) ... [2025-02-05 21:53:00,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d6a25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:53:00, skipping insertion in model container [2025-02-05 21:53:00,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:53:00" (3/3) ... [2025-02-05 21:53:00,047 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-86.i [2025-02-05 21:53:00,059 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:53:00,060 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-86.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:53:00,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:53:00,115 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;@2e8541cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:53:00,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:53:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 21:53:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 21:53:00,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:00,134 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:00,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:00,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1976386731, now seen corresponding path program 1 times [2025-02-05 21:53:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:00,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197662874] [2025-02-05 21:53:00,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:00,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:00,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 21:53:00,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 21:53:00,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 21:53:00,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:00,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197662874] [2025-02-05 21:53:00,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197662874] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:53:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138545271] [2025-02-05 21:53:00,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:00,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:53:00,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:53:00,486 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:53:00,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:53:00,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 21:53:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 21:53:00,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:00,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:00,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:53:00,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:53:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 21:53:00,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:53:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138545271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:53:00,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:53:00,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974513571] [2025-02-05 21:53:00,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:00,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:53:00,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:00,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:53:00,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:53:00,715 INFO L87 Difference]: Start difference. First operand has 100 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 21:53:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:00,741 INFO L93 Difference]: Finished difference Result 194 states and 343 transitions. [2025-02-05 21:53:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:53:00,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2025-02-05 21:53:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:00,747 INFO L225 Difference]: With dead ends: 194 [2025-02-05 21:53:00,748 INFO L226 Difference]: Without dead ends: 97 [2025-02-05 21:53:00,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:53:00,752 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:00,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:53:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-05 21:53:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-05 21:53:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 21:53:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2025-02-05 21:53:00,785 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 212 [2025-02-05 21:53:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:00,785 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2025-02-05 21:53:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 21:53:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2025-02-05 21:53:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 21:53:00,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:00,788 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:00,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:53:00,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:53:00,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:00,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1921162605, now seen corresponding path program 1 times [2025-02-05 21:53:00,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:00,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339110569] [2025-02-05 21:53:00,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:01,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 21:53:01,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 21:53:01,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:01,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:01,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339110569] [2025-02-05 21:53:01,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339110569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:01,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:01,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:53:01,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35313526] [2025-02-05 21:53:01,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:01,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:53:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:01,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:53:01,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:53:01,354 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:01,566 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2025-02-05 21:53:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:53:01,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2025-02-05 21:53:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:01,569 INFO L225 Difference]: With dead ends: 192 [2025-02-05 21:53:01,569 INFO L226 Difference]: Without dead ends: 98 [2025-02-05 21:53:01,569 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-02-05 21:53:01,570 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 147 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:01,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 185 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:53:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-05 21:53:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-05 21:53:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 21:53:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 151 transitions. [2025-02-05 21:53:01,580 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 151 transitions. Word has length 212 [2025-02-05 21:53:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:01,582 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 151 transitions. [2025-02-05 21:53:01,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2025-02-05 21:53:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 21:53:01,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:01,584 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:01,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:53:01,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:01,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:01,585 INFO L85 PathProgramCache]: Analyzing trace with hash -184600964, now seen corresponding path program 1 times [2025-02-05 21:53:01,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638402444] [2025-02-05 21:53:01,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:01,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 21:53:01,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 21:53:01,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:01,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638402444] [2025-02-05 21:53:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638402444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:01,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:01,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:53:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126262454] [2025-02-05 21:53:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:53:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:01,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:53:01,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:53:01,831 INFO L87 Difference]: Start difference. First operand 98 states and 151 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:02,059 INFO L93 Difference]: Finished difference Result 278 states and 426 transitions. [2025-02-05 21:53:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:53:02,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-02-05 21:53:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:02,062 INFO L225 Difference]: With dead ends: 278 [2025-02-05 21:53:02,062 INFO L226 Difference]: Without dead ends: 183 [2025-02-05 21:53:02,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:53:02,063 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 201 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:02,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 662 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:53:02,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-05 21:53:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 127. [2025-02-05 21:53:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-05 21:53:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2025-02-05 21:53:02,079 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 214 [2025-02-05 21:53:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:02,079 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2025-02-05 21:53:02,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2025-02-05 21:53:02,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 21:53:02,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:02,085 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:02,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:53:02,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:02,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:02,086 INFO L85 PathProgramCache]: Analyzing trace with hash -695135141, now seen corresponding path program 1 times [2025-02-05 21:53:02,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:02,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348537758] [2025-02-05 21:53:02,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:02,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:02,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 21:53:02,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 21:53:02,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:02,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:02,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:02,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348537758] [2025-02-05 21:53:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348537758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:02,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:02,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:53:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330854681] [2025-02-05 21:53:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:02,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:53:02,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:02,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:53:02,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:53:02,345 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:02,557 INFO L93 Difference]: Finished difference Result 303 states and 460 transitions. [2025-02-05 21:53:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:53:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-02-05 21:53:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:02,560 INFO L225 Difference]: With dead ends: 303 [2025-02-05 21:53:02,560 INFO L226 Difference]: Without dead ends: 202 [2025-02-05 21:53:02,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:53:02,561 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 123 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:02,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 489 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:53:02,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-05 21:53:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2025-02-05 21:53:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 110 states have internal predecessors, (141), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 21:53:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 277 transitions. [2025-02-05 21:53:02,596 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 277 transitions. Word has length 214 [2025-02-05 21:53:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:02,596 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 277 transitions. [2025-02-05 21:53:02,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 277 transitions. [2025-02-05 21:53:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 21:53:02,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:02,598 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:02,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:53:02,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1200693766, now seen corresponding path program 1 times [2025-02-05 21:53:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004144482] [2025-02-05 21:53:02,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:02,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 21:53:02,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 21:53:02,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:02,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004144482] [2025-02-05 21:53:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004144482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:53:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677830173] [2025-02-05 21:53:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:53:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:06,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:53:06,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:53:06,258 INFO L87 Difference]: Start difference. First operand 182 states and 277 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:07,226 INFO L93 Difference]: Finished difference Result 359 states and 536 transitions. [2025-02-05 21:53:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:53:07,226 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-02-05 21:53:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:07,230 INFO L225 Difference]: With dead ends: 359 [2025-02-05 21:53:07,230 INFO L226 Difference]: Without dead ends: 258 [2025-02-05 21:53:07,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:53:07,232 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 350 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:07,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 934 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:53:07,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-05 21:53:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 199. [2025-02-05 21:53:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 21:53:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 300 transitions. [2025-02-05 21:53:07,253 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 300 transitions. Word has length 214 [2025-02-05 21:53:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:07,254 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 300 transitions. [2025-02-05 21:53:07,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 300 transitions. [2025-02-05 21:53:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 21:53:07,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:07,256 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:07,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:53:07,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:07,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1297322171, now seen corresponding path program 1 times [2025-02-05 21:53:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:07,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275864304] [2025-02-05 21:53:07,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:07,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 21:53:07,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 21:53:07,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:07,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275864304] [2025-02-05 21:53:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275864304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:07,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:53:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533729102] [2025-02-05 21:53:07,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:53:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:07,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:53:07,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:07,336 INFO L87 Difference]: Start difference. First operand 199 states and 300 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:07,373 INFO L93 Difference]: Finished difference Result 400 states and 604 transitions. [2025-02-05 21:53:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:53:07,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2025-02-05 21:53:07,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:07,376 INFO L225 Difference]: With dead ends: 400 [2025-02-05 21:53:07,376 INFO L226 Difference]: Without dead ends: 299 [2025-02-05 21:53:07,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:07,377 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 142 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:07,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 294 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:53:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-05 21:53:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2025-02-05 21:53:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 189 states have internal predecessors, (243), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:53:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 447 transitions. [2025-02-05 21:53:07,406 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 447 transitions. Word has length 214 [2025-02-05 21:53:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:07,407 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 447 transitions. [2025-02-05 21:53:07,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 447 transitions. [2025-02-05 21:53:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 21:53:07,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:07,408 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:07,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:53:07,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:07,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:07,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1520994954, now seen corresponding path program 1 times [2025-02-05 21:53:07,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:07,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579373729] [2025-02-05 21:53:07,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:07,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 21:53:07,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 21:53:07,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:07,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579373729] [2025-02-05 21:53:12,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579373729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:12,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:53:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985456209] [2025-02-05 21:53:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:12,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:53:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:12,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:53:12,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:53:12,361 INFO L87 Difference]: Start difference. First operand 297 states and 447 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:15,308 INFO L93 Difference]: Finished difference Result 347 states and 505 transitions. [2025-02-05 21:53:15,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:53:15,311 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-02-05 21:53:15,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:15,313 INFO L225 Difference]: With dead ends: 347 [2025-02-05 21:53:15,313 INFO L226 Difference]: Without dead ends: 345 [2025-02-05 21:53:15,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-02-05 21:53:15,316 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 401 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:15,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 825 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 21:53:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-05 21:53:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2025-02-05 21:53:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 190 states have (on average 1.2842105263157895) internal successors, (244), 190 states have internal predecessors, (244), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:53:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 448 transitions. [2025-02-05 21:53:15,351 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 448 transitions. Word has length 215 [2025-02-05 21:53:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:15,351 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 448 transitions. [2025-02-05 21:53:15,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 448 transitions. [2025-02-05 21:53:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 21:53:15,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:15,353 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:15,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:53:15,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:15,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash -37795641, now seen corresponding path program 1 times [2025-02-05 21:53:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108824437] [2025-02-05 21:53:15,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:15,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 21:53:15,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 21:53:15,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:15,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:15,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108824437] [2025-02-05 21:53:15,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108824437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:15,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:53:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705388635] [2025-02-05 21:53:15,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:15,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:53:15,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:15,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:53:15,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:15,479 INFO L87 Difference]: Start difference. First operand 298 states and 448 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:15,502 INFO L93 Difference]: Finished difference Result 508 states and 763 transitions. [2025-02-05 21:53:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:53:15,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-02-05 21:53:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:15,505 INFO L225 Difference]: With dead ends: 508 [2025-02-05 21:53:15,505 INFO L226 Difference]: Without dead ends: 306 [2025-02-05 21:53:15,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:53:15,506 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:15,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 282 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:53:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-05 21:53:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2025-02-05 21:53:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 190 states have (on average 1.268421052631579) internal successors, (241), 190 states have internal predecessors, (241), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:53:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 445 transitions. [2025-02-05 21:53:15,524 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 445 transitions. Word has length 215 [2025-02-05 21:53:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:15,525 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 445 transitions. [2025-02-05 21:53:15,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 445 transitions. [2025-02-05 21:53:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 21:53:15,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:15,526 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:15,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:53:15,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:15,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 849708040, now seen corresponding path program 1 times [2025-02-05 21:53:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:15,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966512595] [2025-02-05 21:53:15,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:15,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:15,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 21:53:15,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 21:53:15,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:15,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:23,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966512595] [2025-02-05 21:53:23,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966512595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:23,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:23,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 21:53:23,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684237909] [2025-02-05 21:53:23,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:23,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:53:23,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:23,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:53:23,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:53:23,824 INFO L87 Difference]: Start difference. First operand 298 states and 445 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 21:53:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:30,834 INFO L93 Difference]: Finished difference Result 347 states and 500 transitions. [2025-02-05 21:53:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:53:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 215 [2025-02-05 21:53:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:30,838 INFO L225 Difference]: With dead ends: 347 [2025-02-05 21:53:30,839 INFO L226 Difference]: Without dead ends: 345 [2025-02-05 21:53:30,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 21:53:30,840 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 354 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:30,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1256 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 21:53:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-05 21:53:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2025-02-05 21:53:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 190 states have (on average 1.268421052631579) internal successors, (241), 190 states have internal predecessors, (241), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:53:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 445 transitions. [2025-02-05 21:53:30,877 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 445 transitions. Word has length 215 [2025-02-05 21:53:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:30,877 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 445 transitions. [2025-02-05 21:53:30,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-02-05 21:53:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 445 transitions. [2025-02-05 21:53:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 21:53:30,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:30,879 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:30,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:53:30,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:30,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash -664347226, now seen corresponding path program 1 times [2025-02-05 21:53:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512096634] [2025-02-05 21:53:30,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:30,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 21:53:30,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 21:53:30,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:30,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:36,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512096634] [2025-02-05 21:53:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512096634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:36,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:36,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:53:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352981899] [2025-02-05 21:53:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:36,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:53:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:36,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:53:36,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:53:36,056 INFO L87 Difference]: Start difference. First operand 298 states and 445 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:43,256 INFO L93 Difference]: Finished difference Result 368 states and 524 transitions. [2025-02-05 21:53:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:53:43,256 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-02-05 21:53:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:43,261 INFO L225 Difference]: With dead ends: 368 [2025-02-05 21:53:43,261 INFO L226 Difference]: Without dead ends: 366 [2025-02-05 21:53:43,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 21:53:43,262 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 338 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:43,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 785 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 21:53:43,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-05 21:53:43,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 308. [2025-02-05 21:53:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:53:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 458 transitions. [2025-02-05 21:53:43,280 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 458 transitions. Word has length 215 [2025-02-05 21:53:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:43,280 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 458 transitions. [2025-02-05 21:53:43,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 458 transitions. [2025-02-05 21:53:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 21:53:43,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:43,282 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:43,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:53:43,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:43,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1823165607, now seen corresponding path program 1 times [2025-02-05 21:53:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506261077] [2025-02-05 21:53:43,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:43,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 21:53:43,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 21:53:43,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:43,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:53:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:53:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:53:49,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506261077] [2025-02-05 21:53:49,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506261077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:53:49,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:53:49,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:53:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910178054] [2025-02-05 21:53:49,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:53:49,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:53:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:53:49,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:53:49,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:53:49,985 INFO L87 Difference]: Start difference. First operand 308 states and 458 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:53:55,991 INFO L93 Difference]: Finished difference Result 362 states and 518 transitions. [2025-02-05 21:53:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:53:55,991 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-02-05 21:53:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:53:55,995 INFO L225 Difference]: With dead ends: 362 [2025-02-05 21:53:55,995 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 21:53:55,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=214, Invalid=542, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:53:55,996 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 282 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:53:55,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 905 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 21:53:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 21:53:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 308. [2025-02-05 21:53:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.27) internal successors, (254), 200 states have internal predecessors, (254), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:53:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 458 transitions. [2025-02-05 21:53:56,019 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 458 transitions. Word has length 215 [2025-02-05 21:53:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:53:56,019 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 458 transitions. [2025-02-05 21:53:56,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 16 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:53:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 458 transitions. [2025-02-05 21:53:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 21:53:56,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:53:56,022 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:53:56,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:53:56,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:53:56,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:53:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash 921215512, now seen corresponding path program 1 times [2025-02-05 21:53:56,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:53:56,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378127092] [2025-02-05 21:53:56,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:53:56,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:53:56,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 21:53:56,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 21:53:56,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:53:56,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:54:01,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378127092] [2025-02-05 21:54:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378127092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:01,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:01,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 21:54:01,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245547589] [2025-02-05 21:54:01,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:01,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 21:54:01,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:01,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 21:54:01,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-02-05 21:54:01,901 INFO L87 Difference]: Start difference. First operand 308 states and 458 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:54:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:05,357 INFO L93 Difference]: Finished difference Result 371 states and 529 transitions. [2025-02-05 21:54:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:54:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-02-05 21:54:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:05,363 INFO L225 Difference]: With dead ends: 371 [2025-02-05 21:54:05,363 INFO L226 Difference]: Without dead ends: 369 [2025-02-05 21:54:05,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=318, Invalid=804, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 21:54:05,364 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 302 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:05,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 781 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:54:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-05 21:54:05,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 312. [2025-02-05 21:54:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 204 states have (on average 1.2696078431372548) internal successors, (259), 204 states have internal predecessors, (259), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:54:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 463 transitions. [2025-02-05 21:54:05,386 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 463 transitions. Word has length 216 [2025-02-05 21:54:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:05,387 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 463 transitions. [2025-02-05 21:54:05,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:54:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 463 transitions. [2025-02-05 21:54:05,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 21:54:05,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:05,388 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:05,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:54:05,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:05,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:05,389 INFO L85 PathProgramCache]: Analyzing trace with hash -886238951, now seen corresponding path program 1 times [2025-02-05 21:54:05,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133165878] [2025-02-05 21:54:05,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:05,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 21:54:05,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 21:54:05,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:05,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:54:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 21:54:17,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:54:17,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133165878] [2025-02-05 21:54:17,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133165878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:54:17,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:54:17,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 21:54:17,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575051652] [2025-02-05 21:54:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:54:17,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:54:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:54:17,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:54:17,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:54:17,186 INFO L87 Difference]: Start difference. First operand 312 states and 463 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:54:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:54:25,587 INFO L93 Difference]: Finished difference Result 365 states and 523 transitions. [2025-02-05 21:54:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:54:25,588 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-02-05 21:54:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:54:25,589 INFO L225 Difference]: With dead ends: 365 [2025-02-05 21:54:25,590 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 21:54:25,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=341, Invalid=849, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 21:54:25,591 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 202 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:54:25,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1039 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 21:54:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 21:54:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 309. [2025-02-05 21:54:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 201 states have (on average 1.2686567164179106) internal successors, (255), 201 states have internal predecessors, (255), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 21:54:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 459 transitions. [2025-02-05 21:54:25,607 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 459 transitions. Word has length 216 [2025-02-05 21:54:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:54:25,607 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 459 transitions. [2025-02-05 21:54:25,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 21:54:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 459 transitions. [2025-02-05 21:54:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 21:54:25,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:54:25,609 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:54:25,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:54:25,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:54:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:54:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash 658941500, now seen corresponding path program 1 times [2025-02-05 21:54:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:54:25,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130110453] [2025-02-05 21:54:25,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:54:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:54:25,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 21:54:25,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 21:54:25,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:54:25,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat