./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_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_loopvsstraightlinecode_50-1loop_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 f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:41:40,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:41:40,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:41:40,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:41:40,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:41:40,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:41:40,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:41:40,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:41:40,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:41:40,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:41:40,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:41:40,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:41:40,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:41:40,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:41:40,323 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:41:40,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:41:40,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:41:40,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:41:40,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:41:40,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:41:40,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:41:40,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:41:40,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:41:40,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:41:40,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:41:40,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:41:40,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:41:40,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:41:40,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:41:40,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:41:40,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:41:40,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:41:40,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:41:40,326 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 -> f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b [2025-02-06 01:41:40,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:41:40,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:41:40,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:41:40,547 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:41:40,547 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:41:40,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2025-02-06 01:41:41,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccb27ac8a/0bdac468aef147aba01e62e162562ac6/FLAG95e318a31 [2025-02-06 01:41:41,882 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:41:41,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2025-02-06 01:41:41,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccb27ac8a/0bdac468aef147aba01e62e162562ac6/FLAG95e318a31 [2025-02-06 01:41:42,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccb27ac8a/0bdac468aef147aba01e62e162562ac6 [2025-02-06 01:41:42,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:41:42,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:41:42,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:41:42,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:41:42,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:41:42,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201ef298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42, skipping insertion in model container [2025-02-06 01:41:42,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:41:42,380 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_loopvsstraightlinecode_50-1loop_file-86.i[915,928] [2025-02-06 01:41:42,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:41:42,442 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:41:42,449 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_loopvsstraightlinecode_50-1loop_file-86.i[915,928] [2025-02-06 01:41:42,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:41:42,479 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:41:42,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42 WrapperNode [2025-02-06 01:41:42,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:41:42,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:41:42,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:41:42,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:41:42,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,518 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-02-06 01:41:42,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:41:42,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:41:42,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:41:42,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:41:42,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,539 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-06 01:41:42,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:41:42,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:41:42,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:41:42,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:41:42,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (1/1) ... [2025-02-06 01:41:42,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:41:42,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:41:42,592 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-06 01:41:42,601 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-06 01:41:42,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:41:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:41:42,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:41:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:41:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:41:42,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:41:42,689 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:41:42,691 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:41:42,905 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-06 01:41:42,905 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:41:42,911 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:41:42,912 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:41:42,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:41:42 BoogieIcfgContainer [2025-02-06 01:41:42,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:41:42,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:41:42,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:41:42,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:41:42,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:41:42" (1/3) ... [2025-02-06 01:41:42,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f1919b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:41:42, skipping insertion in model container [2025-02-06 01:41:42,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:42" (2/3) ... [2025-02-06 01:41:42,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f1919b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:41:42, skipping insertion in model container [2025-02-06 01:41:42,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:41:42" (3/3) ... [2025-02-06 01:41:42,922 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-86.i [2025-02-06 01:41:42,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:41:42,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-86.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:41:42,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:41:42,989 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;@666d9fff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:41:42,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:41:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 01:41:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 01:41:43,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:43,003 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:41:43,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:43,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash -24679608, now seen corresponding path program 1 times [2025-02-06 01:41:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013990749] [2025-02-06 01:41:43,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:43,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:43,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 01:41:43,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 01:41:43,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:43,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 01:41:43,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:43,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013990749] [2025-02-06 01:41:43,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013990749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:41:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369044378] [2025-02-06 01:41:43,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:43,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:41:43,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:41:43,238 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-06 01:41:43,243 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-06 01:41:43,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 01:41:43,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 01:41:43,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:43,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:43,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:41:43,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:41:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 01:41:43,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:41:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369044378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:43,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:41:43,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:41:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588350793] [2025-02-06 01:41:43,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:43,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:41:43,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:43,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:41:43,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:41:43,453 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:41:43,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:43,467 INFO L93 Difference]: Finished difference Result 105 states and 172 transitions. [2025-02-06 01:41:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:41:43,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-02-06 01:41:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:43,472 INFO L225 Difference]: With dead ends: 105 [2025-02-06 01:41:43,472 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 01:41:43,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-06 01:41:43,476 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:43,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:41:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 01:41:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 01:41:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 01:41:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-02-06 01:41:43,498 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2025-02-06 01:41:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:43,498 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-02-06 01:41:43,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:41:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-02-06 01:41:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 01:41:43,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:43,501 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:41:43,507 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-06 01:41:43,705 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-06 01:41:43,705 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:43,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1543714601, now seen corresponding path program 1 times [2025-02-06 01:41:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:43,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108680728] [2025-02-06 01:41:43,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:43,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:43,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 01:41:43,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 01:41:43,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:43,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:41:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108680728] [2025-02-06 01:41:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108680728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:41:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917045380] [2025-02-06 01:41:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:44,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:41:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:44,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:41:44,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:41:44,140 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:44,308 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2025-02-06 01:41:44,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:41:44,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-02-06 01:41:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:44,314 INFO L225 Difference]: With dead ends: 148 [2025-02-06 01:41:44,314 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 01:41:44,314 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-06 01:41:44,316 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:44,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 240 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:41:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 01:41:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2025-02-06 01:41:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:41:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2025-02-06 01:41:44,333 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 101 [2025-02-06 01:41:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:44,333 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2025-02-06 01:41:44,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2025-02-06 01:41:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 01:41:44,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:44,334 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:41:44,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:41:44,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:44,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1038155976, now seen corresponding path program 1 times [2025-02-06 01:41:44,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:44,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881047803] [2025-02-06 01:41:44,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:44,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 01:41:44,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 01:41:44,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:44,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:41:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:49,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881047803] [2025-02-06 01:41:49,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881047803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:49,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:49,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 01:41:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035001347] [2025-02-06 01:41:49,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:49,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 01:41:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:49,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 01:41:49,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 01:41:49,827 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:51,829 INFO L93 Difference]: Finished difference Result 195 states and 281 transitions. [2025-02-06 01:41:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 01:41:51,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-02-06 01:41:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:51,832 INFO L225 Difference]: With dead ends: 195 [2025-02-06 01:41:51,832 INFO L226 Difference]: Without dead ends: 147 [2025-02-06 01:41:51,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2025-02-06 01:41:51,833 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 295 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 368 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 01:41:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-06 01:41:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97. [2025-02-06 01:41:51,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:41:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2025-02-06 01:41:51,844 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 101 [2025-02-06 01:41:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:51,844 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2025-02-06 01:41:51,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2025-02-06 01:41:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 01:41:51,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:51,846 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:41:51,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:41:51,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:51,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash -758795383, now seen corresponding path program 1 times [2025-02-06 01:41:51,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303789179] [2025-02-06 01:41:51,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:51,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 01:41:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 01:41:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:51,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:41:51,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:51,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303789179] [2025-02-06 01:41:51,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303789179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:51,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:51,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:41:51,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159189276] [2025-02-06 01:41:51,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:41:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:51,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:41:51,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:41:51,923 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:51,961 INFO L93 Difference]: Finished difference Result 192 states and 283 transitions. [2025-02-06 01:41:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:41:51,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-02-06 01:41:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:51,963 INFO L225 Difference]: With dead ends: 192 [2025-02-06 01:41:51,963 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 01:41:51,963 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-06 01:41:51,964 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 67 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:51,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 150 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:41:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 01:41:51,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2025-02-06 01:41:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:41:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 207 transitions. [2025-02-06 01:41:51,982 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 207 transitions. Word has length 101 [2025-02-06 01:41:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:51,982 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 207 transitions. [2025-02-06 01:41:51,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 207 transitions. [2025-02-06 01:41:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:41:51,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:51,983 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:41:51,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:41:51,984 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:51,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2089107076, now seen corresponding path program 1 times [2025-02-06 01:41:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:51,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136500493] [2025-02-06 01:41:51,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:51,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:41:52,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:41:52,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:52,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:41:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:56,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136500493] [2025-02-06 01:41:56,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136500493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:56,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:56,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 01:41:56,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841949773] [2025-02-06 01:41:56,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:56,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 01:41:56,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:56,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 01:41:56,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-06 01:41:56,339 INFO L87 Difference]: Start difference. First operand 142 states and 207 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:58,943 INFO L93 Difference]: Finished difference Result 192 states and 265 transitions. [2025-02-06 01:41:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 01:41:58,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-02-06 01:41:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:58,946 INFO L225 Difference]: With dead ends: 192 [2025-02-06 01:41:58,946 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 01:41:58,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2025-02-06 01:41:58,947 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 314 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:58,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 390 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 01:41:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 01:41:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 143. [2025-02-06 01:41:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:41:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2025-02-06 01:41:58,967 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 102 [2025-02-06 01:41:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:58,967 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2025-02-06 01:41:58,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2025-02-06 01:41:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:41:58,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:58,971 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:41:58,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:41:58,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:58,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash 647069625, now seen corresponding path program 1 times [2025-02-06 01:41:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037368475] [2025-02-06 01:41:58,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:58,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:41:59,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:41:59,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:59,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:41:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037368475] [2025-02-06 01:41:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037368475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:59,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:41:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030857010] [2025-02-06 01:41:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:41:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:59,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:41:59,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:41:59,067 INFO L87 Difference]: Start difference. First operand 143 states and 208 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:59,084 INFO L93 Difference]: Finished difference Result 247 states and 361 transitions. [2025-02-06 01:41:59,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:41:59,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-02-06 01:41:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:59,088 INFO L225 Difference]: With dead ends: 247 [2025-02-06 01:41:59,088 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 01:41:59,089 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-06 01:41:59,090 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:59,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:41:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 01:41:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2025-02-06 01:41:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:41:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2025-02-06 01:41:59,109 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2025-02-06 01:41:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:59,110 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2025-02-06 01:41:59,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:41:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2025-02-06 01:41:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:41:59,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:59,111 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:41:59,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 01:41:59,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:59,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:59,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1534573306, now seen corresponding path program 1 times [2025-02-06 01:41:59,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:59,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184105413] [2025-02-06 01:41:59,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:59,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:59,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:41:59,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:41:59,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:59,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:42:03,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:03,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184105413] [2025-02-06 01:42:03,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184105413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:03,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:03,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 01:42:03,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558500574] [2025-02-06 01:42:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:03,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 01:42:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:03,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 01:42:03,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-06 01:42:03,607 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:42:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:06,468 INFO L93 Difference]: Finished difference Result 193 states and 261 transitions. [2025-02-06 01:42:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 01:42:06,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2025-02-06 01:42:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:06,470 INFO L225 Difference]: With dead ends: 193 [2025-02-06 01:42:06,470 INFO L226 Difference]: Without dead ends: 191 [2025-02-06 01:42:06,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2025-02-06 01:42:06,471 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 191 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:06,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 454 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 01:42:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-06 01:42:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2025-02-06 01:42:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 94 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:42:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 205 transitions. [2025-02-06 01:42:06,486 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 205 transitions. Word has length 102 [2025-02-06 01:42:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:06,487 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 205 transitions. [2025-02-06 01:42:06,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:42:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 205 transitions. [2025-02-06 01:42:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:42:06,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:06,488 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:06,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 01:42:06,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:06,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash 20518040, now seen corresponding path program 1 times [2025-02-06 01:42:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:06,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957448295] [2025-02-06 01:42:06,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:06,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:42:06,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:42:06,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:42:10,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:10,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957448295] [2025-02-06 01:42:10,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957448295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:10,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:10,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 01:42:10,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573904994] [2025-02-06 01:42:10,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:10,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 01:42:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:10,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 01:42:10,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-02-06 01:42:10,358 INFO L87 Difference]: Start difference. First operand 143 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:42:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:12,081 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2025-02-06 01:42:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 01:42:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-02-06 01:42:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:12,086 INFO L225 Difference]: With dead ends: 213 [2025-02-06 01:42:12,086 INFO L226 Difference]: Without dead ends: 211 [2025-02-06 01:42:12,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 01:42:12,087 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 213 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:12,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 468 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 01:42:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-06 01:42:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2025-02-06 01:42:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:42:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2025-02-06 01:42:12,119 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2025-02-06 01:42:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:12,119 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2025-02-06 01:42:12,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:42:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2025-02-06 01:42:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 01:42:12,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:12,120 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:12,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 01:42:12,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:12,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1786936423, now seen corresponding path program 1 times [2025-02-06 01:42:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247986186] [2025-02-06 01:42:12,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:12,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:12,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 01:42:12,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 01:42:12,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:12,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:42:17,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247986186] [2025-02-06 01:42:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247986186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:17,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:17,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 01:42:17,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915464422] [2025-02-06 01:42:17,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:17,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 01:42:17,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:17,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 01:42:17,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-02-06 01:42:17,724 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:42:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:22,670 INFO L93 Difference]: Finished difference Result 207 states and 278 transitions. [2025-02-06 01:42:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 01:42:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-02-06 01:42:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:22,672 INFO L225 Difference]: With dead ends: 207 [2025-02-06 01:42:22,673 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 01:42:22,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-02-06 01:42:22,674 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 183 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:22,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 472 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 01:42:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 01:42:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2025-02-06 01:42:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 104 states have internal predecessors, (128), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:42:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2025-02-06 01:42:22,687 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 102 [2025-02-06 01:42:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:22,687 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2025-02-06 01:42:22,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:42:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2025-02-06 01:42:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 01:42:22,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:22,688 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:22,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 01:42:22,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 677202278, now seen corresponding path program 1 times [2025-02-06 01:42:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:22,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720030762] [2025-02-06 01:42:22,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:22,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 01:42:22,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 01:42:22,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:22,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:42:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720030762] [2025-02-06 01:42:34,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720030762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:34,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:34,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 01:42:34,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310015654] [2025-02-06 01:42:34,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:34,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 01:42:34,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:34,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 01:42:34,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-02-06 01:42:34,318 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:42:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:41,268 INFO L93 Difference]: Finished difference Result 218 states and 290 transitions. [2025-02-06 01:42:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 01:42:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2025-02-06 01:42:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:41,271 INFO L225 Difference]: With dead ends: 218 [2025-02-06 01:42:41,271 INFO L226 Difference]: Without dead ends: 216 [2025-02-06 01:42:41,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=389, Invalid=1017, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 01:42:41,272 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 194 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:41,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 513 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 01:42:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-06 01:42:41,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 157. [2025-02-06 01:42:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 108 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:42:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 223 transitions. [2025-02-06 01:42:41,288 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 223 transitions. Word has length 103 [2025-02-06 01:42:41,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:41,288 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 223 transitions. [2025-02-06 01:42:41,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:42:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 223 transitions. [2025-02-06 01:42:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 01:42:41,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:41,289 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:42:41,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 01:42:41,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:41,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1130252185, now seen corresponding path program 1 times [2025-02-06 01:42:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:41,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052674689] [2025-02-06 01:42:41,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:41,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 01:42:41,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 01:42:41,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:42:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052674689] [2025-02-06 01:42:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052674689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:53,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:53,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-06 01:42:53,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125147772] [2025-02-06 01:42:53,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:53,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 01:42:53,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:53,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 01:42:53,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-02-06 01:42:53,023 INFO L87 Difference]: Start difference. First operand 157 states and 223 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:43:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:43:03,651 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2025-02-06 01:43:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 01:43:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 103 [2025-02-06 01:43:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:43:03,653 INFO L225 Difference]: With dead ends: 212 [2025-02-06 01:43:03,653 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 01:43:03,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=384, Invalid=948, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 01:43:03,654 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 206 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-06 01:43:03,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 458 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-06 01:43:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 01:43:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 154. [2025-02-06 01:43:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:43:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 219 transitions. [2025-02-06 01:43:03,662 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 219 transitions. Word has length 103 [2025-02-06 01:43:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:43:03,662 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 219 transitions. [2025-02-06 01:43:03,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 01:43:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions. [2025-02-06 01:43:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 01:43:03,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:43:03,663 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:43:03,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 01:43:03,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:43:03,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:43:03,663 INFO L85 PathProgramCache]: Analyzing trace with hash 414928266, now seen corresponding path program 1 times [2025-02-06 01:43:03,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:43:03,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735063167] [2025-02-06 01:43:03,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:43:03,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:43:03,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 01:43:03,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 01:43:03,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:43:03,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:43:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 01:43:07,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:43:07,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735063167] [2025-02-06 01:43:07,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735063167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:43:07,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:43:07,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-06 01:43:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379820373] [2025-02-06 01:43:07,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:43:07,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 01:43:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:43:07,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 01:43:07,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 01:43:07,869 INFO L87 Difference]: Start difference. First operand 154 states and 219 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:43:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:43:11,580 INFO L93 Difference]: Finished difference Result 198 states and 268 transitions. [2025-02-06 01:43:11,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 01:43:11,583 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2025-02-06 01:43:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:43:11,584 INFO L225 Difference]: With dead ends: 198 [2025-02-06 01:43:11,586 INFO L226 Difference]: Without dead ends: 196 [2025-02-06 01:43:11,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-02-06 01:43:11,587 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 142 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 01:43:11,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 473 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 01:43:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-06 01:43:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2025-02-06 01:43:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 01:43:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2025-02-06 01:43:11,607 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 103 [2025-02-06 01:43:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:43:11,607 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2025-02-06 01:43:11,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 01:43:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2025-02-06 01:43:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 01:43:11,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:43:11,608 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:43:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 01:43:11,608 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:43:11,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:43:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash 724778797, now seen corresponding path program 1 times [2025-02-06 01:43:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:43:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302010702] [2025-02-06 01:43:11,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:43:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:43:11,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 01:43:11,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 01:43:11,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:43:11,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat