./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.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 fee106c2dd9d07a82140ad551bdb46665897289e1764fe2cd6376e02d0b80705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:35:40,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:35:41,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:35:41,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:35:41,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:35:41,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:35:41,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:35:41,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:35:41,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:35:41,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:35:41,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:35:41,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:35:41,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:35:41,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:35:41,059 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:35:41,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:35:41,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:35:41,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:35:41,060 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:35:41,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:35:41,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:35:41,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:35:41,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:35:41,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:35:41,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:35:41,061 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:35:41,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:35:41,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:35:41,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:35:41,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:35:41,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:35:41,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:35:41,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:35:41,062 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 -> fee106c2dd9d07a82140ad551bdb46665897289e1764fe2cd6376e02d0b80705 [2025-02-05 23:35:41,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:35:41,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:35:41,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:35:41,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:35:41,362 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:35:41,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2025-02-05 23:35:42,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76d2c6096/09ba11dc25bf47238801e6b73884251c/FLAG33f8178bd [2025-02-05 23:35:42,875 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:35:42,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2025-02-05 23:35:42,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76d2c6096/09ba11dc25bf47238801e6b73884251c/FLAG33f8178bd [2025-02-05 23:35:42,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/76d2c6096/09ba11dc25bf47238801e6b73884251c [2025-02-05 23:35:42,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:35:42,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:35:42,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:35:42,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:35:42,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:35:42,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:35:42" (1/1) ... [2025-02-05 23:35:42,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1209da12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:42, skipping insertion in model container [2025-02-05 23:35:42,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:35:42" (1/1) ... [2025-02-05 23:35:42,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:35:43,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i[919,932] [2025-02-05 23:35:43,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:35:43,114 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:35:43,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i[919,932] [2025-02-05 23:35:43,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:35:43,176 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:35:43,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43 WrapperNode [2025-02-05 23:35:43,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:35:43,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:35:43,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:35:43,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:35:43,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,219 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2025-02-05 23:35:43,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:35:43,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:35:43,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:35:43,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:35:43,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 23:35:43,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,269 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:35:43,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:35:43,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:35:43,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:35:43,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (1/1) ... [2025-02-05 23:35:43,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:35:43,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:35:43,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 23:35:43,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 23:35:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:35:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:35:43,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:35:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:35:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:35:43,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:35:43,432 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:35:43,433 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:35:43,792 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 23:35:43,793 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:35:43,808 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:35:43,811 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:35:43,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:35:43 BoogieIcfgContainer [2025-02-05 23:35:43,811 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:35:43,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:35:43,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:35:43,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:35:43,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:35:42" (1/3) ... [2025-02-05 23:35:43,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb6c2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:35:43, skipping insertion in model container [2025-02-05 23:35:43,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:35:43" (2/3) ... [2025-02-05 23:35:43,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb6c2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:35:43, skipping insertion in model container [2025-02-05 23:35:43,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:35:43" (3/3) ... [2025-02-05 23:35:43,820 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2025-02-05 23:35:43,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:35:43,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:35:43,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:35:43,898 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;@1e8fdb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:35:43,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:35:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 23:35:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 23:35:43,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:43,914 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:43,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:43,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:43,918 INFO L85 PathProgramCache]: Analyzing trace with hash 686547460, now seen corresponding path program 1 times [2025-02-05 23:35:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:43,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852276792] [2025-02-05 23:35:43,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:43,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 23:35:44,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 23:35:44,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:44,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-05 23:35:44,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:44,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852276792] [2025-02-05 23:35:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852276792] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:35:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362091165] [2025-02-05 23:35:44,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:44,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:35:44,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:35:44,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:35:44,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 23:35:44,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 23:35:44,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 23:35:44,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:44,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:44,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:35:44,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:35:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-02-05 23:35:44,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:35:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362091165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:44,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:35:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:35:44,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821151358] [2025-02-05 23:35:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:35:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:44,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:35:44,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:35:44,392 INFO L87 Difference]: Start difference. First operand has 80 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 23:35:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:44,420 INFO L93 Difference]: Finished difference Result 154 states and 256 transitions. [2025-02-05 23:35:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:35:44,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2025-02-05 23:35:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:44,429 INFO L225 Difference]: With dead ends: 154 [2025-02-05 23:35:44,429 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 23:35:44,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:35:44,436 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:44,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:35:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 23:35:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-05 23:35:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 23:35:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-02-05 23:35:44,472 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 126 [2025-02-05 23:35:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:44,474 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-02-05 23:35:44,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 23:35:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-02-05 23:35:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 23:35:44,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:44,477 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:44,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 23:35:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:35:44,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:44,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1525375617, now seen corresponding path program 1 times [2025-02-05 23:35:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121484703] [2025-02-05 23:35:44,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:44,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 23:35:44,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 23:35:44,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:44,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:45,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:45,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121484703] [2025-02-05 23:35:45,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121484703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:45,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:45,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:35:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048690705] [2025-02-05 23:35:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:45,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:35:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:45,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:35:45,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:35:45,085 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:45,167 INFO L93 Difference]: Finished difference Result 206 states and 317 transitions. [2025-02-05 23:35:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:35:45,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2025-02-05 23:35:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:45,170 INFO L225 Difference]: With dead ends: 206 [2025-02-05 23:35:45,172 INFO L226 Difference]: Without dead ends: 132 [2025-02-05 23:35:45,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:35:45,173 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:45,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 203 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:35:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-05 23:35:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2025-02-05 23:35:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:35:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2025-02-05 23:35:45,192 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 126 [2025-02-05 23:35:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:45,192 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2025-02-05 23:35:45,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2025-02-05 23:35:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 23:35:45,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:45,193 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:35:45,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1252582795, now seen corresponding path program 1 times [2025-02-05 23:35:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326754632] [2025-02-05 23:35:45,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:45,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 23:35:45,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 23:35:45,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:45,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:45,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326754632] [2025-02-05 23:35:45,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326754632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:45,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:45,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:35:45,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073485629] [2025-02-05 23:35:45,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:45,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:35:45,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:45,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:35:45,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:35:45,428 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:45,481 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2025-02-05 23:35:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:35:45,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2025-02-05 23:35:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:45,483 INFO L225 Difference]: With dead ends: 214 [2025-02-05 23:35:45,485 INFO L226 Difference]: Without dead ends: 132 [2025-02-05 23:35:45,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:35:45,487 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 51 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:45,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:35:45,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-05 23:35:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2025-02-05 23:35:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 23:35:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. [2025-02-05 23:35:45,518 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 184 transitions. Word has length 127 [2025-02-05 23:35:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:45,520 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 184 transitions. [2025-02-05 23:35:45,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 184 transitions. [2025-02-05 23:35:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 23:35:45,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:45,524 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:45,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:35:45,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:45,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:45,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1368175982, now seen corresponding path program 1 times [2025-02-05 23:35:45,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399955133] [2025-02-05 23:35:45,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:45,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 23:35:45,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 23:35:45,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:45,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399955133] [2025-02-05 23:35:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399955133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:35:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449565595] [2025-02-05 23:35:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:45,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:35:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:45,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:35:45,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:35:45,712 INFO L87 Difference]: Start difference. First operand 123 states and 184 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:45,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:45,771 INFO L93 Difference]: Finished difference Result 271 states and 412 transitions. [2025-02-05 23:35:45,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:35:45,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-02-05 23:35:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:45,774 INFO L225 Difference]: With dead ends: 271 [2025-02-05 23:35:45,776 INFO L226 Difference]: Without dead ends: 197 [2025-02-05 23:35:45,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:35:45,777 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:45,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 210 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:35:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-05 23:35:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-02-05 23:35:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 140 states have internal predecessors, (192), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 23:35:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 294 transitions. [2025-02-05 23:35:45,811 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 294 transitions. Word has length 128 [2025-02-05 23:35:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:45,812 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 294 transitions. [2025-02-05 23:35:45,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 294 transitions. [2025-02-05 23:35:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 23:35:45,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:45,813 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:45,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:35:45,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1342921776, now seen corresponding path program 1 times [2025-02-05 23:35:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263049018] [2025-02-05 23:35:45,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:45,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 23:35:45,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 23:35:45,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:45,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263049018] [2025-02-05 23:35:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263049018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:46,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:46,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:35:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723204511] [2025-02-05 23:35:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:46,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:35:46,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:46,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:35:46,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:35:46,268 INFO L87 Difference]: Start difference. First operand 195 states and 294 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:46,429 INFO L93 Difference]: Finished difference Result 444 states and 668 transitions. [2025-02-05 23:35:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 23:35:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-02-05 23:35:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:46,434 INFO L225 Difference]: With dead ends: 444 [2025-02-05 23:35:46,435 INFO L226 Difference]: Without dead ends: 298 [2025-02-05 23:35:46,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:35:46,437 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 73 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:46,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 393 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:35:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-05 23:35:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 293. [2025-02-05 23:35:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 219 states have (on average 1.356164383561644) internal successors, (297), 221 states have internal predecessors, (297), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:35:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 431 transitions. [2025-02-05 23:35:46,482 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 431 transitions. Word has length 130 [2025-02-05 23:35:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:46,484 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 431 transitions. [2025-02-05 23:35:46,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 431 transitions. [2025-02-05 23:35:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 23:35:46,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:46,487 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:46,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 23:35:46,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:46,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1401656503, now seen corresponding path program 1 times [2025-02-05 23:35:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:46,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923964804] [2025-02-05 23:35:46,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:46,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 23:35:46,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 23:35:46,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:46,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923964804] [2025-02-05 23:35:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923964804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:46,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:46,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:35:46,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390739476] [2025-02-05 23:35:46,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:46,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:35:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:46,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:35:46,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:35:46,987 INFO L87 Difference]: Start difference. First operand 293 states and 431 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:47,070 INFO L93 Difference]: Finished difference Result 561 states and 831 transitions. [2025-02-05 23:35:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:35:47,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-02-05 23:35:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:47,074 INFO L225 Difference]: With dead ends: 561 [2025-02-05 23:35:47,076 INFO L226 Difference]: Without dead ends: 311 [2025-02-05 23:35:47,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:35:47,077 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:47,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 193 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:35:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-02-05 23:35:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 293. [2025-02-05 23:35:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 219 states have (on average 1.3515981735159817) internal successors, (296), 221 states have internal predecessors, (296), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:35:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 430 transitions. [2025-02-05 23:35:47,113 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 430 transitions. Word has length 131 [2025-02-05 23:35:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:47,114 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 430 transitions. [2025-02-05 23:35:47,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 430 transitions. [2025-02-05 23:35:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 23:35:47,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:47,115 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:47,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:35:47,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -555473017, now seen corresponding path program 1 times [2025-02-05 23:35:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013001594] [2025-02-05 23:35:47,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:47,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 23:35:47,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 23:35:47,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:47,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:47,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:47,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013001594] [2025-02-05 23:35:47,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013001594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:47,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:47,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:35:47,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131883855] [2025-02-05 23:35:47,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:47,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:35:47,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:47,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:35:47,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:35:47,298 INFO L87 Difference]: Start difference. First operand 293 states and 430 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:47,392 INFO L93 Difference]: Finished difference Result 777 states and 1154 transitions. [2025-02-05 23:35:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:35:47,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-02-05 23:35:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:47,395 INFO L225 Difference]: With dead ends: 777 [2025-02-05 23:35:47,397 INFO L226 Difference]: Without dead ends: 530 [2025-02-05 23:35:47,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:35:47,398 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 80 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:47,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 368 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:35:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-05 23:35:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 524. [2025-02-05 23:35:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 396 states have (on average 1.3686868686868687) internal successors, (542), 400 states have internal predecessors, (542), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 23:35:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 776 transitions. [2025-02-05 23:35:47,452 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 776 transitions. Word has length 133 [2025-02-05 23:35:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:47,453 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 776 transitions. [2025-02-05 23:35:47,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 776 transitions. [2025-02-05 23:35:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 23:35:47,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:47,455 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:47,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:35:47,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:47,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash -810209562, now seen corresponding path program 1 times [2025-02-05 23:35:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986814518] [2025-02-05 23:35:47,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:47,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:47,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 23:35:47,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 23:35:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:47,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:51,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986814518] [2025-02-05 23:35:51,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986814518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:51,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:51,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 23:35:51,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844147190] [2025-02-05 23:35:51,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:51,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 23:35:51,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:51,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 23:35:51,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-05 23:35:51,204 INFO L87 Difference]: Start difference. First operand 524 states and 776 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:35:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:52,377 INFO L93 Difference]: Finished difference Result 837 states and 1212 transitions. [2025-02-05 23:35:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 23:35:52,377 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-02-05 23:35:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:52,380 INFO L225 Difference]: With dead ends: 837 [2025-02-05 23:35:52,381 INFO L226 Difference]: Without dead ends: 717 [2025-02-05 23:35:52,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2025-02-05 23:35:52,382 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 525 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:52,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 705 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 23:35:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-02-05 23:35:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 547. [2025-02-05 23:35:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 419 states have (on average 1.369928400954654) internal successors, (574), 423 states have internal predecessors, (574), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 23:35:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 808 transitions. [2025-02-05 23:35:52,435 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 808 transitions. Word has length 133 [2025-02-05 23:35:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:52,435 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 808 transitions. [2025-02-05 23:35:52,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:35:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 808 transitions. [2025-02-05 23:35:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 23:35:52,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:52,441 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:52,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 23:35:52,441 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:52,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1103612569, now seen corresponding path program 1 times [2025-02-05 23:35:52,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:52,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065399120] [2025-02-05 23:35:52,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:52,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:52,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 23:35:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 23:35:52,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:52,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:52,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:52,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065399120] [2025-02-05 23:35:52,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065399120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:52,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:52,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:35:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871989000] [2025-02-05 23:35:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:52,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:35:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:52,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:35:52,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:35:52,571 INFO L87 Difference]: Start difference. First operand 547 states and 808 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:52,682 INFO L93 Difference]: Finished difference Result 1307 states and 1948 transitions. [2025-02-05 23:35:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:35:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-02-05 23:35:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:52,686 INFO L225 Difference]: With dead ends: 1307 [2025-02-05 23:35:52,686 INFO L226 Difference]: Without dead ends: 839 [2025-02-05 23:35:52,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:35:52,688 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 132 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:52,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 431 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:35:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-02-05 23:35:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 559. [2025-02-05 23:35:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 431 states have (on average 1.3665893271461718) internal successors, (589), 435 states have internal predecessors, (589), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 23:35:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 823 transitions. [2025-02-05 23:35:52,754 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 823 transitions. Word has length 133 [2025-02-05 23:35:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:52,754 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 823 transitions. [2025-02-05 23:35:52,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 823 transitions. [2025-02-05 23:35:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 23:35:52,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:52,756 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:52,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 23:35:52,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:52,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2098990088, now seen corresponding path program 1 times [2025-02-05 23:35:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:52,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394752753] [2025-02-05 23:35:52,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:52,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 23:35:52,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 23:35:52,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:52,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:54,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:54,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394752753] [2025-02-05 23:35:54,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394752753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:54,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:54,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 23:35:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394533755] [2025-02-05 23:35:54,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:54,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 23:35:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:54,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 23:35:54,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:35:54,622 INFO L87 Difference]: Start difference. First operand 559 states and 823 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:35:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:55,156 INFO L93 Difference]: Finished difference Result 929 states and 1357 transitions. [2025-02-05 23:35:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 23:35:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-02-05 23:35:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:55,159 INFO L225 Difference]: With dead ends: 929 [2025-02-05 23:35:55,160 INFO L226 Difference]: Without dead ends: 680 [2025-02-05 23:35:55,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:35:55,162 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 271 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:55,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 775 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 23:35:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-02-05 23:35:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 559. [2025-02-05 23:35:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 431 states have (on average 1.3642691415313226) internal successors, (588), 435 states have internal predecessors, (588), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2025-02-05 23:35:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 822 transitions. [2025-02-05 23:35:55,193 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 822 transitions. Word has length 133 [2025-02-05 23:35:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:55,193 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 822 transitions. [2025-02-05 23:35:55,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:35:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 822 transitions. [2025-02-05 23:35:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 23:35:55,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:55,195 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:55,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 23:35:55,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:55,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1320743739, now seen corresponding path program 1 times [2025-02-05 23:35:55,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:55,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466772518] [2025-02-05 23:35:55,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:55,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 23:35:55,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 23:35:55,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:55,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:55,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466772518] [2025-02-05 23:35:55,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466772518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:55,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:55,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:35:55,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802421264] [2025-02-05 23:35:55,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:55,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:35:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:55,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:35:55,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:35:55,277 INFO L87 Difference]: Start difference. First operand 559 states and 822 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:55,383 INFO L93 Difference]: Finished difference Result 804 states and 1187 transitions. [2025-02-05 23:35:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:35:55,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2025-02-05 23:35:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:55,391 INFO L225 Difference]: With dead ends: 804 [2025-02-05 23:35:55,391 INFO L226 Difference]: Without dead ends: 324 [2025-02-05 23:35:55,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 23:35:55,393 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 129 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:55,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 169 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:35:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-05 23:35:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2025-02-05 23:35:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 242 states have (on average 1.3057851239669422) internal successors, (316), 244 states have internal predecessors, (316), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:35:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 450 transitions. [2025-02-05 23:35:55,408 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 450 transitions. Word has length 133 [2025-02-05 23:35:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:55,408 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 450 transitions. [2025-02-05 23:35:55,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:35:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 450 transitions. [2025-02-05 23:35:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 23:35:55,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:55,412 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:55,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 23:35:55,412 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:55,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash -838636631, now seen corresponding path program 1 times [2025-02-05 23:35:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:55,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012589005] [2025-02-05 23:35:55,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:55,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:55,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 23:35:55,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 23:35:55,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:55,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:35:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:35:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:35:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012589005] [2025-02-05 23:35:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012589005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:35:55,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:35:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:35:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607836188] [2025-02-05 23:35:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:35:55,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:35:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:35:55,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:35:55,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:35:55,506 INFO L87 Difference]: Start difference. First operand 316 states and 450 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 23:35:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:35:55,626 INFO L93 Difference]: Finished difference Result 565 states and 814 transitions. [2025-02-05 23:35:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:35:55,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2025-02-05 23:35:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:35:55,628 INFO L225 Difference]: With dead ends: 565 [2025-02-05 23:35:55,628 INFO L226 Difference]: Without dead ends: 325 [2025-02-05 23:35:55,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:35:55,629 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 63 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:35:55,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 299 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:35:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-05 23:35:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 316. [2025-02-05 23:35:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 244 states have internal predecessors, (315), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:35:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 449 transitions. [2025-02-05 23:35:55,644 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 449 transitions. Word has length 133 [2025-02-05 23:35:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:35:55,644 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 449 transitions. [2025-02-05 23:35:55,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 23:35:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 449 transitions. [2025-02-05 23:35:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 23:35:55,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:35:55,645 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:35:55,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 23:35:55,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:35:55,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:35:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -905643384, now seen corresponding path program 1 times [2025-02-05 23:35:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:35:55,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866246227] [2025-02-05 23:35:55,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:35:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:35:55,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 23:35:55,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 23:35:55,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:35:55,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:36:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866246227] [2025-02-05 23:36:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866246227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:01,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 23:36:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272980113] [2025-02-05 23:36:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:01,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 23:36:01,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:01,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 23:36:01,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-05 23:36:01,499 INFO L87 Difference]: Start difference. First operand 316 states and 449 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:36:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:04,504 INFO L93 Difference]: Finished difference Result 396 states and 555 transitions. [2025-02-05 23:36:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 23:36:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-02-05 23:36:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:04,506 INFO L225 Difference]: With dead ends: 396 [2025-02-05 23:36:04,506 INFO L226 Difference]: Without dead ends: 394 [2025-02-05 23:36:04,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=325, Invalid=935, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 23:36:04,507 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:04,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 813 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 23:36:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-05 23:36:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 352. [2025-02-05 23:36:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 278 states have (on average 1.3201438848920863) internal successors, (367), 280 states have internal predecessors, (367), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:36:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 501 transitions. [2025-02-05 23:36:04,526 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 501 transitions. Word has length 133 [2025-02-05 23:36:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:04,526 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 501 transitions. [2025-02-05 23:36:04,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:36:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 501 transitions. [2025-02-05 23:36:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 23:36:04,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:04,527 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:04,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 23:36:04,527 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:04,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash -940880953, now seen corresponding path program 1 times [2025-02-05 23:36:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:04,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855007313] [2025-02-05 23:36:04,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:04,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:04,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 23:36:04,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 23:36:04,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:04,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:36:09,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855007313] [2025-02-05 23:36:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855007313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:09,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 23:36:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947801116] [2025-02-05 23:36:09,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 23:36:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:09,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 23:36:09,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:36:09,260 INFO L87 Difference]: Start difference. First operand 352 states and 501 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:36:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:10,926 INFO L93 Difference]: Finished difference Result 630 states and 902 transitions. [2025-02-05 23:36:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 23:36:10,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2025-02-05 23:36:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:10,929 INFO L225 Difference]: With dead ends: 630 [2025-02-05 23:36:10,929 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 23:36:10,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2025-02-05 23:36:10,931 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 280 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:10,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 725 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 23:36:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 23:36:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 352. [2025-02-05 23:36:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 278 states have (on average 1.3093525179856116) internal successors, (364), 280 states have internal predecessors, (364), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:36:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 498 transitions. [2025-02-05 23:36:10,951 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 498 transitions. Word has length 133 [2025-02-05 23:36:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:10,951 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 498 transitions. [2025-02-05 23:36:10,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:36:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 498 transitions. [2025-02-05 23:36:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 23:36:10,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:10,953 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:10,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 23:36:10,953 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:10,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash 415613279, now seen corresponding path program 1 times [2025-02-05 23:36:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201074231] [2025-02-05 23:36:10,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:10,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:10,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 23:36:10,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 23:36:10,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:36:13,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:13,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201074231] [2025-02-05 23:36:13,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201074231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:13,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:13,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 23:36:13,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60612033] [2025-02-05 23:36:13,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:13,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 23:36:13,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:13,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 23:36:13,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-05 23:36:13,861 INFO L87 Difference]: Start difference. First operand 352 states and 498 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:36:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:15,877 INFO L93 Difference]: Finished difference Result 635 states and 905 transitions. [2025-02-05 23:36:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 23:36:15,877 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2025-02-05 23:36:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:15,879 INFO L225 Difference]: With dead ends: 635 [2025-02-05 23:36:15,880 INFO L226 Difference]: Without dead ends: 385 [2025-02-05 23:36:15,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=334, Invalid=998, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 23:36:15,881 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 214 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:15,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1028 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 23:36:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-02-05 23:36:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 360. [2025-02-05 23:36:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 286 states have (on average 1.3076923076923077) internal successors, (374), 288 states have internal predecessors, (374), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:36:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 508 transitions. [2025-02-05 23:36:15,898 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 508 transitions. Word has length 134 [2025-02-05 23:36:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:15,899 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 508 transitions. [2025-02-05 23:36:15,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:36:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 508 transitions. [2025-02-05 23:36:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 23:36:15,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:15,901 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:15,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 23:36:15,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:15,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1643586691, now seen corresponding path program 1 times [2025-02-05 23:36:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:15,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777486478] [2025-02-05 23:36:15,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:15,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:15,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 23:36:15,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 23:36:15,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:15,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-02-05 23:36:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:19,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777486478] [2025-02-05 23:36:19,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777486478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:19,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:19,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-05 23:36:19,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126697105] [2025-02-05 23:36:19,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:19,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 23:36:19,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:19,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 23:36:19,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:36:19,054 INFO L87 Difference]: Start difference. First operand 360 states and 508 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:36:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:20,036 INFO L93 Difference]: Finished difference Result 615 states and 876 transitions. [2025-02-05 23:36:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 23:36:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2025-02-05 23:36:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:20,039 INFO L225 Difference]: With dead ends: 615 [2025-02-05 23:36:20,039 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 23:36:20,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-02-05 23:36:20,041 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 220 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:20,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 843 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 23:36:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 23:36:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 351. [2025-02-05 23:36:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 277 states have (on average 1.3032490974729243) internal successors, (361), 279 states have internal predecessors, (361), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:36:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 495 transitions. [2025-02-05 23:36:20,059 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 495 transitions. Word has length 134 [2025-02-05 23:36:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:20,059 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 495 transitions. [2025-02-05 23:36:20,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-02-05 23:36:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 495 transitions. [2025-02-05 23:36:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 23:36:20,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:20,063 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:20,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 23:36:20,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:20,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash 290612806, now seen corresponding path program 1 times [2025-02-05 23:36:20,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:20,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831787843] [2025-02-05 23:36:20,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:20,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:20,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 23:36:20,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 23:36:20,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:20,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-02-05 23:36:20,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:20,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831787843] [2025-02-05 23:36:20,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831787843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:20,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:20,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:36:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012557605] [2025-02-05 23:36:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:20,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:36:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:20,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:36:20,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:36:20,134 INFO L87 Difference]: Start difference. First operand 351 states and 495 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:36:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:20,177 INFO L93 Difference]: Finished difference Result 612 states and 879 transitions. [2025-02-05 23:36:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:36:20,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 257 [2025-02-05 23:36:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:20,181 INFO L225 Difference]: With dead ends: 612 [2025-02-05 23:36:20,181 INFO L226 Difference]: Without dead ends: 375 [2025-02-05 23:36:20,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:36:20,182 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 77 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:20,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 200 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:36:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-05 23:36:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 357. [2025-02-05 23:36:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.3003533568904593) internal successors, (368), 285 states have internal predecessors, (368), 67 states have call successors, (67), 6 states have call predecessors, (67), 6 states have return successors, (67), 65 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 23:36:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 502 transitions. [2025-02-05 23:36:20,201 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 502 transitions. Word has length 257 [2025-02-05 23:36:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 502 transitions. [2025-02-05 23:36:20,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-02-05 23:36:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 502 transitions. [2025-02-05 23:36:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-05 23:36:20,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:20,204 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:20,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 23:36:20,205 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:20,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 568781508, now seen corresponding path program 1 times [2025-02-05 23:36:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412598982] [2025-02-05 23:36:20,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:20,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:20,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 23:36:20,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 23:36:20,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:20,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:36:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412598982] [2025-02-05 23:36:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412598982] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:36:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364234842] [2025-02-05 23:36:20,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:20,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:20,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:20,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:36:20,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 23:36:20,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 23:36:20,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 23:36:20,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:20,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:20,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 23:36:20,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:36:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 1478 proven. 24 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2025-02-05 23:36:20,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:36:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 58 proven. 75 refuted. 0 times theorem prover too weak. 2167 trivial. 0 not checked. [2025-02-05 23:36:20,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364234842] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:36:20,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:36:20,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2025-02-05 23:36:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692397953] [2025-02-05 23:36:20,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:36:20,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 23:36:20,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:20,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 23:36:20,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-05 23:36:20,988 INFO L87 Difference]: Start difference. First operand 357 states and 502 transitions. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 8 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 7 states have call predecessors, (94), 8 states have call successors, (94) [2025-02-05 23:36:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:21,674 INFO L93 Difference]: Finished difference Result 651 states and 925 transitions. [2025-02-05 23:36:21,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 23:36:21,674 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 8 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 7 states have call predecessors, (94), 8 states have call successors, (94) Word has length 258 [2025-02-05 23:36:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:21,677 INFO L225 Difference]: With dead ends: 651 [2025-02-05 23:36:21,677 INFO L226 Difference]: Without dead ends: 382 [2025-02-05 23:36:21,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 23:36:21,678 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 448 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:21,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 830 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 23:36:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-05 23:36:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 348. [2025-02-05 23:36:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 251 states have (on average 1.247011952191235) internal successors, (313), 251 states have internal predecessors, (313), 85 states have call successors, (85), 11 states have call predecessors, (85), 11 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-02-05 23:36:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 483 transitions. [2025-02-05 23:36:21,707 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 483 transitions. Word has length 258 [2025-02-05 23:36:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:21,707 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 483 transitions. [2025-02-05 23:36:21,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 8 states have call successors, (93), 3 states have call predecessors, (93), 5 states have return successors, (94), 7 states have call predecessors, (94), 8 states have call successors, (94) [2025-02-05 23:36:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 483 transitions. [2025-02-05 23:36:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-05 23:36:21,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:21,710 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:21,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 23:36:21,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 23:36:21,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:21,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1031216678, now seen corresponding path program 1 times [2025-02-05 23:36:21,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930896552] [2025-02-05 23:36:21,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:21,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-05 23:36:21,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-05 23:36:21,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:21,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-02-05 23:36:22,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:22,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930896552] [2025-02-05 23:36:22,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930896552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:36:22,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:36:22,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 23:36:22,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046605806] [2025-02-05 23:36:22,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:36:22,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 23:36:22,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:36:22,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 23:36:22,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:36:22,018 INFO L87 Difference]: Start difference. First operand 348 states and 483 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:36:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:36:22,187 INFO L93 Difference]: Finished difference Result 721 states and 1019 transitions. [2025-02-05 23:36:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:36:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 260 [2025-02-05 23:36:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:36:22,190 INFO L225 Difference]: With dead ends: 721 [2025-02-05 23:36:22,190 INFO L226 Difference]: Without dead ends: 450 [2025-02-05 23:36:22,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 23:36:22,191 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 391 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:36:22,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 414 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:36:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-05 23:36:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 302. [2025-02-05 23:36:22,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 224 states have (on average 1.2633928571428572) internal successors, (283), 224 states have internal predecessors, (283), 68 states have call successors, (68), 9 states have call predecessors, (68), 9 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 23:36:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 419 transitions. [2025-02-05 23:36:22,211 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 419 transitions. Word has length 260 [2025-02-05 23:36:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:36:22,211 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 419 transitions. [2025-02-05 23:36:22,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 23:36:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 419 transitions. [2025-02-05 23:36:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-05 23:36:22,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:36:22,213 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:36:22,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 23:36:22,214 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:36:22,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:36:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2028220708, now seen corresponding path program 1 times [2025-02-05 23:36:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:36:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578599306] [2025-02-05 23:36:22,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:36:22,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-05 23:36:22,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-05 23:36:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2302 backedges. 27 proven. 31 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 23:36:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:36:23,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578599306] [2025-02-05 23:36:23,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578599306] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:36:23,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241995978] [2025-02-05 23:36:23,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:36:23,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:36:23,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:36:23,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 23:36:23,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 23:36:23,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-05 23:36:23,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-05 23:36:23,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:36:23,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:36:23,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 23:36:23,305 INFO L279 TraceCheckSpWp]: Computing forward predicates...